/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:59:24,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:59:24,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:59:24,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:59:24,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:59:24,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:59:24,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:59:24,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:59:24,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:59:24,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:59:24,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:59:24,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:59:24,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:59:24,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:59:24,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:59:24,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:59:24,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:59:24,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:59:24,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:59:24,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:59:24,295 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:59:24,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:59:24,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:59:24,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:59:24,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:59:24,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:59:24,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:59:24,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:59:24,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:59:24,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:59:24,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:59:24,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:59:24,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:59:24,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:59:24,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:59:24,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:59:24,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:59:24,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:59:24,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:59:24,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:59:24,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:59:24,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:59:24,318 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:59:24,324 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:59:24,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:59:24,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:59:24,325 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:59:24,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:59:24,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:59:24,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:59:24,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:59:24,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:59:24,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:59:24,326 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:59:24,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:59:24,326 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:59:24,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:59:24,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:59:24,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:59:24,326 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:59:24,326 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:59:24,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:59:24,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:59:24,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:59:24,327 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:59:24,327 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:59:24,327 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:59:24,327 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:59:24,327 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-08 03:59:24,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:59:24,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:59:24,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:59:24,544 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:59:24,544 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:59:24,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i [2022-04-08 03:59:24,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ee1f4ee0/4802b7f7ab2d4d599370073cf6db9a05/FLAGd2e4d5f36 [2022-04-08 03:59:24,948 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:59:24,948 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i [2022-04-08 03:59:24,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ee1f4ee0/4802b7f7ab2d4d599370073cf6db9a05/FLAGd2e4d5f36 [2022-04-08 03:59:24,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ee1f4ee0/4802b7f7ab2d4d599370073cf6db9a05 [2022-04-08 03:59:24,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:59:24,970 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:59:24,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:59:24,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:59:24,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:59:24,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:59:24" (1/1) ... [2022-04-08 03:59:24,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d75f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:24, skipping insertion in model container [2022-04-08 03:59:24,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:59:24" (1/1) ... [2022-04-08 03:59:24,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:59:24,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:59:25,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i[1009,1022] [2022-04-08 03:59:25,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:59:25,134 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:59:25,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i[1009,1022] [2022-04-08 03:59:25,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:59:25,156 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:59:25,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:25 WrapperNode [2022-04-08 03:59:25,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:59:25,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:59:25,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:59:25,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:59:25,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:25" (1/1) ... [2022-04-08 03:59:25,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:25" (1/1) ... [2022-04-08 03:59:25,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:25" (1/1) ... [2022-04-08 03:59:25,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:25" (1/1) ... [2022-04-08 03:59:25,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:25" (1/1) ... [2022-04-08 03:59:25,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:25" (1/1) ... [2022-04-08 03:59:25,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:25" (1/1) ... [2022-04-08 03:59:25,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:59:25,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:59:25,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:59:25,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:59:25,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:25" (1/1) ... [2022-04-08 03:59:25,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:59:25,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:59:25,214 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-08 03:59:25,216 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-08 03:59:25,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:59:25,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:59:25,243 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:59:25,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 03:59:25,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:59:25,243 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:59:25,243 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 03:59:25,243 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:59:25,243 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:59:25,243 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 03:59:25,243 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 03:59:25,243 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:59:25,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:59:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 03:59:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:59:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:59:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:59:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 03:59:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:59:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:59:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:59:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:59:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:59:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:59:25,326 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:59:25,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:59:25,456 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:59:25,462 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:59:25,463 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 03:59:25,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:59:25 BoogieIcfgContainer [2022-04-08 03:59:25,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:59:25,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:59:25,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:59:25,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:59:25,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:59:24" (1/3) ... [2022-04-08 03:59:25,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c039863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:59:25, skipping insertion in model container [2022-04-08 03:59:25,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:25" (2/3) ... [2022-04-08 03:59:25,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c039863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:59:25, skipping insertion in model container [2022-04-08 03:59:25,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:59:25" (3/3) ... [2022-04-08 03:59:25,480 INFO L111 eAbstractionObserver]: Analyzing ICFG mcmillan2006.i [2022-04-08 03:59:25,483 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:59:25,484 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:59:25,511 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:59:25,515 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-08 03:59:25,515 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:59:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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-08 03:59:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 03:59:25,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:25,533 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:25,533 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:25,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1868594418, now seen corresponding path program 1 times [2022-04-08 03:59:25,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:25,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [521921942] [2022-04-08 03:59:25,576 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:59:25,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1868594418, now seen corresponding path program 2 times [2022-04-08 03:59:25,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:25,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527986648] [2022-04-08 03:59:25,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:25,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:25,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:25,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(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(9, 2); {28#true} is VALID [2022-04-08 03:59:25,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 03:59:25,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #70#return; {28#true} is VALID [2022-04-08 03:59:25,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:59:25,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(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(9, 2); {28#true} is VALID [2022-04-08 03:59:25,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 03:59:25,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #70#return; {28#true} is VALID [2022-04-08 03:59:25,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret6 := main(); {28#true} is VALID [2022-04-08 03:59:25,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {28#true} is VALID [2022-04-08 03:59:25,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {33#(= main_~i~0 0)} is VALID [2022-04-08 03:59:25,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#(= main_~i~0 0)} assume !(~i~0 < ~n~0); {34#(<= main_~n~0 0)} is VALID [2022-04-08 03:59:25,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#(<= main_~n~0 0)} ~i~1 := 0; {35#(and (<= main_~n~0 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:25,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#(and (<= main_~n~0 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29#false} is VALID [2022-04-08 03:59:25,829 INFO L272 TraceCheckUtils]: 10: Hoare triple {29#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29#false} is VALID [2022-04-08 03:59:25,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-08 03:59:25,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-08 03:59:25,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-08 03:59:25,830 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-08 03:59:25,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:25,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527986648] [2022-04-08 03:59:25,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527986648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:25,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:25,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:59:25,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:25,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [521921942] [2022-04-08 03:59:25,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [521921942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:25,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:25,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:59:25,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906072418] [2022-04-08 03:59:25,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:25,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 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 14 [2022-04-08 03:59:25,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:25,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:25,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:59:25,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:59:25,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:25,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:59:25,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:59:25,886 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:26,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:26,130 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-08 03:59:26,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:59:26,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 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 14 [2022-04-08 03:59:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:59:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-08 03:59:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-08 03:59:26,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2022-04-08 03:59:26,221 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-08 03:59:26,229 INFO L225 Difference]: With dead ends: 48 [2022-04-08 03:59:26,229 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 03:59:26,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-08 03:59:26,234 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:59:26,235 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 39 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:59:26,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 03:59:26,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-08 03:59:26,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:59:26,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:59:26,255 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:59:26,256 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:59:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:26,259 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-08 03:59:26,260 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-08 03:59:26,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:26,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:26,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-08 03:59:26,261 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-08 03:59:26,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:26,262 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-08 03:59:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-08 03:59:26,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:26,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:26,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:59:26,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:59:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:59:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-08 03:59:26,273 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-08 03:59:26,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:59:26,273 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-08 03:59:26,274 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:26,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-08 03:59:26,298 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-08 03:59:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-08 03:59:26,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 03:59:26,299 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:26,299 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:26,299 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:59:26,299 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:26,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash -426319892, now seen corresponding path program 1 times [2022-04-08 03:59:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:26,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1925902069] [2022-04-08 03:59:26,316 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:59:26,316 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:59:26,316 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:59:26,316 INFO L85 PathProgramCache]: Analyzing trace with hash -426319892, now seen corresponding path program 2 times [2022-04-08 03:59:26,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:26,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856004031] [2022-04-08 03:59:26,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:26,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:26,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:26,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {239#(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(9, 2); {227#true} is VALID [2022-04-08 03:59:26,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-08 03:59:26,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-08 03:59:26,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:59:26,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#(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(9, 2); {227#true} is VALID [2022-04-08 03:59:26,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-08 03:59:26,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-08 03:59:26,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-08 03:59:26,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {227#true} is VALID [2022-04-08 03:59:26,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {232#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-08 03:59:26,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {233#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-08 03:59:26,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {233#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (= main_~x~0.offset 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-08 03:59:26,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} assume !(~i~0 < ~n~0); {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-08 03:59:26,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} ~i~1 := 0; {235#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:26,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {236#(= |main_#t~mem5| 0)} is VALID [2022-04-08 03:59:26,548 INFO L272 TraceCheckUtils]: 12: Hoare triple {236#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {237#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:59:26,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {237#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {238#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:59:26,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {238#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {228#false} is VALID [2022-04-08 03:59:26,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-08 03:59:26,550 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-08 03:59:26,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:26,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856004031] [2022-04-08 03:59:26,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856004031] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:26,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653858393] [2022-04-08 03:59:26,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:59:26,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:26,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:59:26,564 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-08 03:59:26,592 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-08 03:59:26,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:59:26,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:59:26,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 03:59:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:26,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:59:26,715 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-08 03:59:26,774 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-08 03:59:26,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-08 03:59:26,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#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(9, 2); {227#true} is VALID [2022-04-08 03:59:26,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-08 03:59:26,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-08 03:59:26,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-08 03:59:26,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {227#true} is VALID [2022-04-08 03:59:26,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {232#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-08 03:59:26,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-08 03:59:26,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-08 03:59:26,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} assume !(~i~0 < ~n~0); {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-08 03:59:26,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} ~i~1 := 0; {235#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:26,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {236#(= |main_#t~mem5| 0)} is VALID [2022-04-08 03:59:26,840 INFO L272 TraceCheckUtils]: 12: Hoare triple {236#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {279#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:59:26,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:59:26,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {228#false} is VALID [2022-04-08 03:59:26,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-08 03:59:26,841 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-08 03:59:26,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:59:26,963 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 14 treesize of output 12 [2022-04-08 03:59:26,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-04-08 03:59:27,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-08 03:59:27,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {228#false} is VALID [2022-04-08 03:59:27,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:59:27,005 INFO L272 TraceCheckUtils]: 12: Hoare triple {236#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {279#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:59:27,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {302#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {236#(= |main_#t~mem5| 0)} is VALID [2022-04-08 03:59:27,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} ~i~1 := 0; {302#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 03:59:27,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} assume !(~i~0 < ~n~0); {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2022-04-08 03:59:27,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2022-04-08 03:59:27,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#(= 0 (* main_~i~0 4))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2022-04-08 03:59:27,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {316#(= 0 (* main_~i~0 4))} is VALID [2022-04-08 03:59:27,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {227#true} is VALID [2022-04-08 03:59:27,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-08 03:59:27,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-08 03:59:27,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-08 03:59:27,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#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(9, 2); {227#true} is VALID [2022-04-08 03:59:27,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-08 03:59:27,009 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-08 03:59:27,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653858393] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:59:27,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:59:27,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 15 [2022-04-08 03:59:27,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:27,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1925902069] [2022-04-08 03:59:27,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1925902069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:27,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:27,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 03:59:27,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586223271] [2022-04-08 03:59:27,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:27,012 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 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 16 [2022-04-08 03:59:27,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:27,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:27,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:59:27,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 03:59:27,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:27,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 03:59:27,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-08 03:59:27,026 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:27,353 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-08 03:59:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 03:59:27,353 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 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 16 [2022-04-08 03:59:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:59:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-08 03:59:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-08 03:59:27,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2022-04-08 03:59:27,386 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-08 03:59:27,387 INFO L225 Difference]: With dead ends: 32 [2022-04-08 03:59:27,387 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 03:59:27,388 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-04-08 03:59:27,391 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:59:27,393 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 48 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:59:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 03:59:27,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-08 03:59:27,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:59:27,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:27,401 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:27,402 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:27,404 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-08 03:59:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-08 03:59:27,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:27,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:27,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-08 03:59:27,405 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-08 03:59:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:27,407 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-08 03:59:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-08 03:59:27,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:27,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:27,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:59:27,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:59:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-08 03:59:27,414 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2022-04-08 03:59:27,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:59:27,414 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-08 03:59:27,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:27,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-08 03:59:27,436 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-08 03:59:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-08 03:59:27,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 03:59:27,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:27,437 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:27,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 03:59:27,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:27,644 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:27,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1328899642, now seen corresponding path program 1 times [2022-04-08 03:59:27,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:27,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1923716725] [2022-04-08 03:59:27,648 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:59:27,648 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:59:27,648 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:59:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1328899642, now seen corresponding path program 2 times [2022-04-08 03:59:27,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:27,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271706947] [2022-04-08 03:59:27,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:27,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:27,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:27,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {548#(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(9, 2); {534#true} is VALID [2022-04-08 03:59:27,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-08 03:59:27,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-08 03:59:27,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 03:59:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:27,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-08 03:59:27,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-08 03:59:27,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-08 03:59:27,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {542#(and (<= main_~n~0 1) (= main_~i~1 0))} #68#return; {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-08 03:59:27,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:59:27,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {548#(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(9, 2); {534#true} is VALID [2022-04-08 03:59:27,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-08 03:59:27,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-08 03:59:27,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-08 03:59:27,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {534#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {534#true} is VALID [2022-04-08 03:59:27,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {534#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {539#(= main_~i~0 0)} is VALID [2022-04-08 03:59:27,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {539#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {539#(= main_~i~0 0)} is VALID [2022-04-08 03:59:27,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {540#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:27,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(<= main_~i~0 1)} assume !(~i~0 < ~n~0); {541#(<= main_~n~0 1)} is VALID [2022-04-08 03:59:27,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {541#(<= main_~n~0 1)} ~i~1 := 0; {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-08 03:59:27,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {542#(and (<= main_~n~0 1) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-08 03:59:27,737 INFO L272 TraceCheckUtils]: 12: Hoare triple {542#(and (<= main_~n~0 1) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {534#true} is VALID [2022-04-08 03:59:27,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-08 03:59:27,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-08 03:59:27,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-08 03:59:27,738 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {534#true} {542#(and (<= main_~n~0 1) (= main_~i~1 0))} #68#return; {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-08 03:59:27,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {542#(and (<= main_~n~0 1) (= main_~i~1 0))} havoc #t~mem5; {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-08 03:59:27,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {542#(and (<= main_~n~0 1) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {547#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 03:59:27,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {535#false} is VALID [2022-04-08 03:59:27,740 INFO L272 TraceCheckUtils]: 20: Hoare triple {535#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {535#false} is VALID [2022-04-08 03:59:27,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-08 03:59:27,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-08 03:59:27,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-08 03:59:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:59:27,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:27,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271706947] [2022-04-08 03:59:27,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271706947] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:27,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678315392] [2022-04-08 03:59:27,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:59:27,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:27,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:59:27,742 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-08 03:59:27,743 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-08 03:59:27,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:59:27,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:59:27,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 03:59:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:27,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:59:27,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2022-04-08 03:59:27,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#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(9, 2); {534#true} is VALID [2022-04-08 03:59:27,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-08 03:59:27,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-08 03:59:27,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-08 03:59:27,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {534#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {534#true} is VALID [2022-04-08 03:59:27,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {534#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {570#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:27,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {570#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:27,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {570#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {540#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:27,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(<= main_~i~0 1)} assume !(~i~0 < ~n~0); {541#(<= main_~n~0 1)} is VALID [2022-04-08 03:59:27,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {541#(<= main_~n~0 1)} ~i~1 := 0; {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-08 03:59:27,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-08 03:59:27,977 INFO L272 TraceCheckUtils]: 12: Hoare triple {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {534#true} is VALID [2022-04-08 03:59:27,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-08 03:59:27,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-08 03:59:27,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-08 03:59:27,978 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {534#true} {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} #68#return; {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-08 03:59:27,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} havoc #t~mem5; {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-08 03:59:27,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {608#(and (<= 1 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-08 03:59:27,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {608#(and (<= 1 main_~i~1) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {535#false} is VALID [2022-04-08 03:59:27,984 INFO L272 TraceCheckUtils]: 20: Hoare triple {535#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {535#false} is VALID [2022-04-08 03:59:27,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-08 03:59:27,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-08 03:59:27,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-08 03:59:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:59:27,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:59:28,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-08 03:59:28,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-08 03:59:28,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-08 03:59:28,133 INFO L272 TraceCheckUtils]: 20: Hoare triple {535#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {535#false} is VALID [2022-04-08 03:59:28,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {535#false} is VALID [2022-04-08 03:59:28,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {639#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {547#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 03:59:28,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {639#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {639#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:28,135 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {534#true} {639#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {639#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:28,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-08 03:59:28,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-08 03:59:28,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-08 03:59:28,136 INFO L272 TraceCheckUtils]: 12: Hoare triple {639#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {534#true} is VALID [2022-04-08 03:59:28,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {639#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {639#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:28,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {541#(<= main_~n~0 1)} ~i~1 := 0; {639#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:28,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(<= main_~i~0 1)} assume !(~i~0 < ~n~0); {541#(<= main_~n~0 1)} is VALID [2022-04-08 03:59:28,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {570#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {540#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:28,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {570#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:28,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {534#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {570#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:28,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {534#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {534#true} is VALID [2022-04-08 03:59:28,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-08 03:59:28,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-08 03:59:28,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-08 03:59:28,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#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(9, 2); {534#true} is VALID [2022-04-08 03:59:28,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2022-04-08 03:59:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:59:28,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678315392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:59:28,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:59:28,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-08 03:59:28,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:28,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1923716725] [2022-04-08 03:59:28,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1923716725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:28,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:28,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:59:28,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584630725] [2022-04-08 03:59:28,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:28,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-08 03:59:28,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:28,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:59:28,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:59:28,160 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:59:28,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:59:28,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:59:28,161 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:59:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:28,368 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 03:59:28,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:59:28,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-08 03:59:28,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:59:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:59:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-08 03:59:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:59:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-08 03:59:28,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-08 03:59:28,400 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-08 03:59:28,401 INFO L225 Difference]: With dead ends: 46 [2022-04-08 03:59:28,401 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 03:59:28,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-04-08 03:59:28,402 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:59:28,402 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 32 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:59:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 03:59:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-08 03:59:28,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:59:28,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:28,408 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:28,408 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:28,410 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-08 03:59:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-08 03:59:28,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:28,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:28,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-08 03:59:28,410 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-08 03:59:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:28,412 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-08 03:59:28,412 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-08 03:59:28,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:28,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:28,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:59:28,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:59:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-08 03:59:28,413 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2022-04-08 03:59:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:59:28,413 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-08 03:59:28,413 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:59:28,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-08 03:59:28,439 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-08 03:59:28,439 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 03:59:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 03:59:28,440 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:28,440 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:28,458 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-08 03:59:28,656 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,SelfDestructingSolverStorable2 [2022-04-08 03:59:28,658 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:28,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:28,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1936590556, now seen corresponding path program 3 times [2022-04-08 03:59:28,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:28,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1987387496] [2022-04-08 03:59:28,662 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:59:28,662 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:59:28,662 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:59:28,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1936590556, now seen corresponding path program 4 times [2022-04-08 03:59:28,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:28,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842157311] [2022-04-08 03:59:28,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:28,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:28,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:28,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {934#(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(9, 2); {916#true} is VALID [2022-04-08 03:59:28,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-08 03:59:28,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-08 03:59:28,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-08 03:59:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:28,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {916#true} ~cond := #in~cond; {916#true} is VALID [2022-04-08 03:59:28,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#true} assume !(0 == ~cond); {916#true} is VALID [2022-04-08 03:59:28,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-08 03:59:28,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {916#true} {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #68#return; {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:28,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {916#true} call ULTIMATE.init(); {934#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:59:28,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {934#(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(9, 2); {916#true} is VALID [2022-04-08 03:59:28,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-08 03:59:28,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-08 03:59:28,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {916#true} call #t~ret6 := main(); {916#true} is VALID [2022-04-08 03:59:28,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {916#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {916#true} is VALID [2022-04-08 03:59:28,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {916#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {921#(= main_~i~0 0)} is VALID [2022-04-08 03:59:28,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {921#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {921#(= main_~i~0 0)} is VALID [2022-04-08 03:59:28,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {921#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {922#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 03:59:28,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {922#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {923#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 03:59:28,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {923#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {924#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-08 03:59:28,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {924#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} assume !(~i~0 < ~n~0); {924#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-08 03:59:28,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {924#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} ~i~1 := 0; {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:28,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:28,819 INFO L272 TraceCheckUtils]: 14: Hoare triple {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {916#true} is VALID [2022-04-08 03:59:28,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {916#true} ~cond := #in~cond; {916#true} is VALID [2022-04-08 03:59:28,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {916#true} assume !(0 == ~cond); {916#true} is VALID [2022-04-08 03:59:28,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-08 03:59:28,820 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {916#true} {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #68#return; {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:28,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} havoc #t~mem5; {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:28,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {930#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 03:59:28,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {930#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {931#(= |main_#t~mem5| 0)} is VALID [2022-04-08 03:59:28,821 INFO L272 TraceCheckUtils]: 22: Hoare triple {931#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {932#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:59:28,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {932#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {933#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:59:28,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {933#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {917#false} is VALID [2022-04-08 03:59:28,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {917#false} assume !false; {917#false} is VALID [2022-04-08 03:59:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:59:28,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:28,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842157311] [2022-04-08 03:59:28,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842157311] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:28,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500181845] [2022-04-08 03:59:28,823 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:59:28,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:28,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:59:28,824 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-08 03:59:28,825 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-08 03:59:28,861 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:59:28,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:59:28,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 03:59:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:28,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:59:28,918 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-08 03:59:30,020 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-08 03:59:30,021 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 23 treesize of output 10 [2022-04-08 03:59:30,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {916#true} call ULTIMATE.init(); {916#true} is VALID [2022-04-08 03:59:30,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#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(9, 2); {916#true} is VALID [2022-04-08 03:59:30,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-08 03:59:30,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-08 03:59:30,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {916#true} call #t~ret6 := main(); {916#true} is VALID [2022-04-08 03:59:30,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {916#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {916#true} is VALID [2022-04-08 03:59:30,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {916#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {956#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:30,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {956#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {956#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:30,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {956#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {963#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:30,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {963#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {967#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1))} is VALID [2022-04-08 03:59:30,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {967#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {971#(exists ((v_main_~i~0_18 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1) (<= main_~i~0 (+ v_main_~i~0_18 1))))} is VALID [2022-04-08 03:59:30,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {971#(exists ((v_main_~i~0_18 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1) (<= main_~i~0 (+ v_main_~i~0_18 1))))} assume !(~i~0 < ~n~0); {975#(exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1)))} is VALID [2022-04-08 03:59:30,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {975#(exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1)))} ~i~1 := 0; {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} is VALID [2022-04-08 03:59:30,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} is VALID [2022-04-08 03:59:30,096 INFO L272 TraceCheckUtils]: 14: Hoare triple {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} is VALID [2022-04-08 03:59:30,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} ~cond := #in~cond; {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} is VALID [2022-04-08 03:59:30,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} assume !(0 == ~cond); {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} is VALID [2022-04-08 03:59:30,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} assume true; {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} is VALID [2022-04-08 03:59:30,098 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} #68#return; {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} is VALID [2022-04-08 03:59:30,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} havoc #t~mem5; {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} is VALID [2022-04-08 03:59:30,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1005#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))))} is VALID [2022-04-08 03:59:30,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {1005#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {931#(= |main_#t~mem5| 0)} is VALID [2022-04-08 03:59:30,105 INFO L272 TraceCheckUtils]: 22: Hoare triple {931#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1012#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:59:30,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {1012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:59:30,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {1016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {917#false} is VALID [2022-04-08 03:59:30,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {917#false} assume !false; {917#false} is VALID [2022-04-08 03:59:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:59:30,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:59:30,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500181845] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:30,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 03:59:30,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2022-04-08 03:59:30,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:30,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1987387496] [2022-04-08 03:59:30,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1987387496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:30,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:30,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 03:59:30,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182453646] [2022-04-08 03:59:30,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:30,385 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-08 03:59:30,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:30,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:59:30,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:59:30,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 03:59:30,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:30,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 03:59:30,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-04-08 03:59:30,405 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:59:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:30,938 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-04-08 03:59:30,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 03:59:30,938 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-08 03:59:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:59:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:59:30,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-08 03:59:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:59:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-08 03:59:30,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-08 03:59:30,980 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-08 03:59:30,981 INFO L225 Difference]: With dead ends: 42 [2022-04-08 03:59:30,981 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 03:59:30,982 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 03:59:30,982 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:59:30,982 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 62 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:59:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 03:59:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-08 03:59:30,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:59:30,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:30,990 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:30,990 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:30,992 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-08 03:59:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-08 03:59:30,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:30,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:30,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-08 03:59:30,992 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-08 03:59:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:30,993 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-08 03:59:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-08 03:59:30,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:30,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:30,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:59:30,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:59:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-08 03:59:30,995 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2022-04-08 03:59:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:59:30,995 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-08 03:59:30,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:59:30,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-08 03:59:31,026 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-08 03:59:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-08 03:59:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 03:59:31,027 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:31,027 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:31,043 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-08 03:59:31,229 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:31,230 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:31,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:31,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1234500350, now seen corresponding path program 5 times [2022-04-08 03:59:31,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:31,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [794210847] [2022-04-08 03:59:31,236 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:59:31,236 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:59:31,236 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:59:31,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1234500350, now seen corresponding path program 6 times [2022-04-08 03:59:31,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:31,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828964350] [2022-04-08 03:59:31,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:31,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:31,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {1326#(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(9, 2); {1306#true} is VALID [2022-04-08 03:59:31,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 03:59:31,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-08 03:59:31,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-08 03:59:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:31,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-08 03:59:31,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-08 03:59:31,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 03:59:31,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} #68#return; {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-08 03:59:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 03:59:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:31,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-08 03:59:31,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-08 03:59:31,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 03:59:31,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1320#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:31,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:59:31,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#(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(9, 2); {1306#true} is VALID [2022-04-08 03:59:31,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 03:59:31,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-08 03:59:31,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-08 03:59:31,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1306#true} is VALID [2022-04-08 03:59:31,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1311#(= main_~i~0 0)} is VALID [2022-04-08 03:59:31,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {1311#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1311#(= main_~i~0 0)} is VALID [2022-04-08 03:59:31,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {1311#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1312#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:31,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {1312#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1312#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:31,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1313#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:31,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(<= main_~i~0 2)} assume !(~i~0 < ~n~0); {1314#(<= main_~n~0 2)} is VALID [2022-04-08 03:59:31,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~n~0 2)} ~i~1 := 0; {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-08 03:59:31,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-08 03:59:31,346 INFO L272 TraceCheckUtils]: 14: Hoare triple {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-08 03:59:31,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-08 03:59:31,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-08 03:59:31,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 03:59:31,346 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1306#true} {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} #68#return; {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-08 03:59:31,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} havoc #t~mem5; {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-08 03:59:31,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:31,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:31,347 INFO L272 TraceCheckUtils]: 22: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-08 03:59:31,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-08 03:59:31,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-08 03:59:31,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 03:59:31,349 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1306#true} {1320#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:31,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:31,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1325#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 03:59:31,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {1325#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1307#false} is VALID [2022-04-08 03:59:31,355 INFO L272 TraceCheckUtils]: 30: Hoare triple {1307#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1307#false} is VALID [2022-04-08 03:59:31,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-08 03:59:31,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-08 03:59:31,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-08 03:59:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:59:31,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:31,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828964350] [2022-04-08 03:59:31,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828964350] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:31,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324622832] [2022-04-08 03:59:31,356 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:59:31,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:31,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:59:31,357 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-08 03:59:31,370 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-08 03:59:31,408 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 03:59:31,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:59:31,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 03:59:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:31,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:59:31,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-08 03:59:31,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#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(9, 2); {1306#true} is VALID [2022-04-08 03:59:31,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 03:59:31,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-08 03:59:31,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-08 03:59:31,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1306#true} is VALID [2022-04-08 03:59:31,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1348#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:31,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {1348#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1348#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:31,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {1348#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1312#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:31,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {1312#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1312#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:31,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1313#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:31,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(<= main_~i~0 2)} assume !(~i~0 < ~n~0); {1314#(<= main_~n~0 2)} is VALID [2022-04-08 03:59:31,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~n~0 2)} ~i~1 := 0; {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-08 03:59:31,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-08 03:59:31,585 INFO L272 TraceCheckUtils]: 14: Hoare triple {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-08 03:59:31,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-08 03:59:31,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-08 03:59:31,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 03:59:31,586 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1306#true} {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} #68#return; {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-08 03:59:31,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} havoc #t~mem5; {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-08 03:59:31,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-08 03:59:31,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-08 03:59:31,587 INFO L272 TraceCheckUtils]: 22: Hoare triple {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-08 03:59:31,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-08 03:59:31,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-08 03:59:31,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 03:59:31,588 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1306#true} {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} #68#return; {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-08 03:59:31,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} havoc #t~mem5; {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-08 03:59:31,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1417#(and (<= main_~n~0 2) (<= 2 main_~i~1))} is VALID [2022-04-08 03:59:31,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {1417#(and (<= main_~n~0 2) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1307#false} is VALID [2022-04-08 03:59:31,589 INFO L272 TraceCheckUtils]: 30: Hoare triple {1307#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1307#false} is VALID [2022-04-08 03:59:31,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-08 03:59:31,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-08 03:59:31,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-08 03:59:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:59:31,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:59:31,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-08 03:59:31,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-08 03:59:31,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-08 03:59:31,759 INFO L272 TraceCheckUtils]: 30: Hoare triple {1307#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1307#false} is VALID [2022-04-08 03:59:31,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {1325#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1307#false} is VALID [2022-04-08 03:59:31,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1325#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 03:59:31,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:31,761 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1306#true} {1320#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:31,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 03:59:31,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-08 03:59:31,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-08 03:59:31,761 INFO L272 TraceCheckUtils]: 22: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-08 03:59:31,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:31,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {1472#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:31,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {1472#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {1472#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:31,763 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1306#true} {1472#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {1472#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:31,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 03:59:31,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-08 03:59:31,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-08 03:59:31,763 INFO L272 TraceCheckUtils]: 14: Hoare triple {1472#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-08 03:59:31,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {1472#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1472#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:31,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~n~0 2)} ~i~1 := 0; {1472#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:31,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(<= main_~i~0 2)} assume !(~i~0 < ~n~0); {1314#(<= main_~n~0 2)} is VALID [2022-04-08 03:59:31,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1313#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:31,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {1312#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1312#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:31,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {1348#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1312#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:31,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {1348#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1348#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:31,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1348#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:31,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1306#true} is VALID [2022-04-08 03:59:31,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-08 03:59:31,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-08 03:59:31,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 03:59:31,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#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(9, 2); {1306#true} is VALID [2022-04-08 03:59:31,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-08 03:59:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:59:31,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324622832] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:59:31,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:59:31,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-04-08 03:59:31,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:31,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [794210847] [2022-04-08 03:59:31,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [794210847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:31,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:31,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 03:59:31,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036409179] [2022-04-08 03:59:31,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:31,770 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2022-04-08 03:59:31,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:31,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:31,791 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-08 03:59:31,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 03:59:31,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:31,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 03:59:31,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-08 03:59:31,792 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:32,092 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-08 03:59:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 03:59:32,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2022-04-08 03:59:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:59:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-08 03:59:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-08 03:59:32,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-08 03:59:32,130 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-08 03:59:32,131 INFO L225 Difference]: With dead ends: 60 [2022-04-08 03:59:32,131 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 03:59:32,132 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-04-08 03:59:32,132 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:59:32,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 44 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:59:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 03:59:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-08 03:59:32,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:59:32,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:32,141 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:32,141 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:32,142 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-08 03:59:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-08 03:59:32,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:32,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:32,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-08 03:59:32,143 INFO L87 Difference]: Start difference. First operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-08 03:59:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:32,144 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-08 03:59:32,144 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-08 03:59:32,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:32,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:32,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:59:32,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:59:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-04-08 03:59:32,145 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2022-04-08 03:59:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:59:32,146 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-04-08 03:59:32,146 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:32,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 40 transitions. [2022-04-08 03:59:32,181 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-08 03:59:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-08 03:59:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 03:59:32,181 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:32,181 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:32,199 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-08 03:59:32,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:32,396 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:32,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:32,396 INFO L85 PathProgramCache]: Analyzing trace with hash -487899940, now seen corresponding path program 7 times [2022-04-08 03:59:32,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:32,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1250143839] [2022-04-08 03:59:32,398 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:59:32,398 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:59:32,398 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:59:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash -487899940, now seen corresponding path program 8 times [2022-04-08 03:59:32,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:32,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092339342] [2022-04-08 03:59:32,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:32,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:32,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:32,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {1851#(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(9, 2); {1827#true} is VALID [2022-04-08 03:59:32,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-08 03:59:32,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-08 03:59:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:59:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:32,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-08 03:59:32,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-08 03:59:32,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-08 03:59:32,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:32,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 03:59:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:32,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-08 03:59:32,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-08 03:59:32,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-08 03:59:32,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:32,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {1827#true} call ULTIMATE.init(); {1851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:59:32,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {1851#(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(9, 2); {1827#true} is VALID [2022-04-08 03:59:32,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-08 03:59:32,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-08 03:59:32,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {1827#true} call #t~ret6 := main(); {1827#true} is VALID [2022-04-08 03:59:32,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {1827#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1827#true} is VALID [2022-04-08 03:59:32,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {1827#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1832#(= main_~i~0 0)} is VALID [2022-04-08 03:59:32,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {1832#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1832#(= main_~i~0 0)} is VALID [2022-04-08 03:59:32,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {1832#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1833#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 03:59:32,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {1833#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1833#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 03:59:32,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {1833#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1834#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:59:32,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {1834#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:59:32,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {1835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1836#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-08 03:59:32,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {1836#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} assume !(~i~0 < ~n~0); {1836#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-08 03:59:32,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {1836#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} ~i~1 := 0; {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:32,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:32,563 INFO L272 TraceCheckUtils]: 16: Hoare triple {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1827#true} is VALID [2022-04-08 03:59:32,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-08 03:59:32,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-08 03:59:32,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-08 03:59:32,564 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1827#true} {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:32,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} havoc #t~mem5; {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:32,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:32,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:32,565 INFO L272 TraceCheckUtils]: 24: Hoare triple {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1827#true} is VALID [2022-04-08 03:59:32,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-08 03:59:32,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-08 03:59:32,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-08 03:59:32,566 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1827#true} {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:32,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:32,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 03:59:32,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {1847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1848#(= |main_#t~mem5| 0)} is VALID [2022-04-08 03:59:32,568 INFO L272 TraceCheckUtils]: 32: Hoare triple {1848#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1849#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:59:32,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {1849#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1850#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:59:32,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {1850#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1828#false} is VALID [2022-04-08 03:59:32,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#false} assume !false; {1828#false} is VALID [2022-04-08 03:59:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:59:32,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:32,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092339342] [2022-04-08 03:59:32,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092339342] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:32,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838401355] [2022-04-08 03:59:32,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:59:32,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:32,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:59:32,571 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-08 03:59:32,572 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-08 03:59:32,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:59:32,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:59:32,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 03:59:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:32,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:59:32,710 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-08 03:59:34,698 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-08 03:59:34,698 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 23 treesize of output 10 [2022-04-08 03:59:34,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {1827#true} call ULTIMATE.init(); {1827#true} is VALID [2022-04-08 03:59:34,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#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(9, 2); {1827#true} is VALID [2022-04-08 03:59:34,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-08 03:59:34,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-08 03:59:34,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {1827#true} call #t~ret6 := main(); {1827#true} is VALID [2022-04-08 03:59:34,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {1827#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1827#true} is VALID [2022-04-08 03:59:34,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {1827#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1873#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:34,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {1873#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1873#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:34,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {1873#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1880#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:34,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {1880#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1880#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:34,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {1880#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1887#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:34,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {1887#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1891#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 2))} is VALID [2022-04-08 03:59:34,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {1891#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1895#(exists ((v_main_~i~0_30 Int)) (and (<= main_~i~0 (+ v_main_~i~0_30 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2)))} is VALID [2022-04-08 03:59:34,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {1895#(exists ((v_main_~i~0_30 Int)) (and (<= main_~i~0 (+ v_main_~i~0_30 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2)))} assume !(~i~0 < ~n~0); {1899#(exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1))))} is VALID [2022-04-08 03:59:34,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {1899#(exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1))))} ~i~1 := 0; {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-08 03:59:34,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-08 03:59:34,817 INFO L272 TraceCheckUtils]: 16: Hoare triple {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-08 03:59:34,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} ~cond := #in~cond; {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-08 03:59:34,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} assume !(0 == ~cond); {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-08 03:59:34,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} assume true; {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-08 03:59:34,821 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} #68#return; {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-08 03:59:34,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} havoc #t~mem5; {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-08 03:59:34,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-08 03:59:34,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-08 03:59:34,830 INFO L272 TraceCheckUtils]: 24: Hoare triple {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-08 03:59:34,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} ~cond := #in~cond; {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-08 03:59:34,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} assume !(0 == ~cond); {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-08 03:59:34,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} assume true; {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-08 03:59:34,831 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} #68#return; {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-08 03:59:34,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} havoc #t~mem5; {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-08 03:59:34,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1954#(and (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 03:59:34,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {1954#(and (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1848#(= |main_#t~mem5| 0)} is VALID [2022-04-08 03:59:34,834 INFO L272 TraceCheckUtils]: 32: Hoare triple {1848#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:59:34,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {1961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:59:34,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {1965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1828#false} is VALID [2022-04-08 03:59:34,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#false} assume !false; {1828#false} is VALID [2022-04-08 03:59:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:59:34,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:59:35,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838401355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:35,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 03:59:35,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2022-04-08 03:59:35,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:35,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1250143839] [2022-04-08 03:59:35,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1250143839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:35,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:35,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 03:59:35,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496693166] [2022-04-08 03:59:35,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:35,102 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-04-08 03:59:35,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:35,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:35,124 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-08 03:59:35,124 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 03:59:35,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:35,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 03:59:35,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2022-04-08 03:59:35,125 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:35,900 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-04-08 03:59:35,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 03:59:35,901 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-04-08 03:59:35,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:59:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-08 03:59:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-08 03:59:35,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 47 transitions. [2022-04-08 03:59:35,950 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-08 03:59:35,951 INFO L225 Difference]: With dead ends: 52 [2022-04-08 03:59:35,951 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 03:59:35,951 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 03:59:35,952 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:59:35,952 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 65 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:59:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 03:59:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-04-08 03:59:35,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:59:35,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:35,962 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:35,962 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:35,963 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-08 03:59:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-08 03:59:35,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:35,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:35,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-04-08 03:59:35,964 INFO L87 Difference]: Start difference. First operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-04-08 03:59:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:35,965 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-08 03:59:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-08 03:59:35,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:35,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:35,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:59:35,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:59:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-04-08 03:59:35,967 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 36 [2022-04-08 03:59:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:59:35,967 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-04-08 03:59:35,967 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:59:35,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 48 transitions. [2022-04-08 03:59:36,008 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-08 03:59:36,008 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-04-08 03:59:36,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 03:59:36,009 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:36,009 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:36,026 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-08 03:59:36,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:36,224 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:36,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1322580298, now seen corresponding path program 9 times [2022-04-08 03:59:36,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:36,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [549838015] [2022-04-08 03:59:36,227 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:59:36,227 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:59:36,227 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:59:36,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1322580298, now seen corresponding path program 10 times [2022-04-08 03:59:36,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:36,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097461825] [2022-04-08 03:59:36,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:36,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:36,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:36,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {2345#(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(9, 2); {2319#true} is VALID [2022-04-08 03:59:36,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-08 03:59:36,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 03:59:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:36,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-08 03:59:36,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-08 03:59:36,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} #68#return; {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-08 03:59:36,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 03:59:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:36,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-08 03:59:36,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-08 03:59:36,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2334#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:36,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-08 03:59:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:36,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-08 03:59:36,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-08 03:59:36,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2339#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:36,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {2319#true} call ULTIMATE.init(); {2345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:59:36,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {2345#(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(9, 2); {2319#true} is VALID [2022-04-08 03:59:36,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-08 03:59:36,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-08 03:59:36,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {2319#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2319#true} is VALID [2022-04-08 03:59:36,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {2319#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2324#(= main_~i~0 0)} is VALID [2022-04-08 03:59:36,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {2324#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2324#(= main_~i~0 0)} is VALID [2022-04-08 03:59:36,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {2324#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2325#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:36,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2325#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:36,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2326#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:36,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {2326#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2326#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:36,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2327#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:36,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {2327#(<= main_~i~0 3)} assume !(~i~0 < ~n~0); {2328#(<= main_~n~0 3)} is VALID [2022-04-08 03:59:36,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {2328#(<= main_~n~0 3)} ~i~1 := 0; {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-08 03:59:36,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-08 03:59:36,339 INFO L272 TraceCheckUtils]: 16: Hoare triple {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-08 03:59:36,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-08 03:59:36,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-08 03:59:36,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,339 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2319#true} {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} #68#return; {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-08 03:59:36,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} havoc #t~mem5; {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-08 03:59:36,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:36,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:36,340 INFO L272 TraceCheckUtils]: 24: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-08 03:59:36,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-08 03:59:36,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-08 03:59:36,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,341 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2319#true} {2334#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:36,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:36,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:36,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:36,342 INFO L272 TraceCheckUtils]: 32: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-08 03:59:36,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-08 03:59:36,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-08 03:59:36,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,343 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2319#true} {2339#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:36,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:36,344 INFO L290 TraceCheckUtils]: 38: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2344#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 03:59:36,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {2344#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2320#false} is VALID [2022-04-08 03:59:36,344 INFO L272 TraceCheckUtils]: 40: Hoare triple {2320#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#false} is VALID [2022-04-08 03:59:36,344 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-08 03:59:36,344 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-08 03:59:36,344 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-08 03:59:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 03:59:36,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:36,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097461825] [2022-04-08 03:59:36,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097461825] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:36,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941754969] [2022-04-08 03:59:36,345 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:59:36,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:36,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:59:36,346 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-08 03:59:36,347 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-08 03:59:36,406 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:59:36,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:59:36,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 03:59:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:36,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:59:36,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {2319#true} call ULTIMATE.init(); {2319#true} is VALID [2022-04-08 03:59:36,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#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(9, 2); {2319#true} is VALID [2022-04-08 03:59:36,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-08 03:59:36,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-08 03:59:36,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {2319#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2319#true} is VALID [2022-04-08 03:59:36,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {2319#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2367#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:36,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {2367#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2367#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:36,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {2367#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2325#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:36,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2325#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:36,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2326#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:36,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {2326#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2326#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:36,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2327#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:36,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {2327#(<= main_~i~0 3)} assume !(~i~0 < ~n~0); {2328#(<= main_~n~0 3)} is VALID [2022-04-08 03:59:36,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {2328#(<= main_~n~0 3)} ~i~1 := 0; {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-08 03:59:36,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-08 03:59:36,694 INFO L272 TraceCheckUtils]: 16: Hoare triple {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-08 03:59:36,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-08 03:59:36,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-08 03:59:36,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,694 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2319#true} {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} #68#return; {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-08 03:59:36,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} havoc #t~mem5; {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-08 03:59:36,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-08 03:59:36,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-08 03:59:36,696 INFO L272 TraceCheckUtils]: 24: Hoare triple {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-08 03:59:36,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-08 03:59:36,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-08 03:59:36,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,696 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2319#true} {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} #68#return; {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-08 03:59:36,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} havoc #t~mem5; {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-08 03:59:36,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-08 03:59:36,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-08 03:59:36,697 INFO L272 TraceCheckUtils]: 32: Hoare triple {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-08 03:59:36,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-08 03:59:36,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-08 03:59:36,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,698 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2319#true} {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} #68#return; {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-08 03:59:36,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} havoc #t~mem5; {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-08 03:59:36,703 INFO L290 TraceCheckUtils]: 38: Hoare triple {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2467#(and (<= 3 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-08 03:59:36,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {2467#(and (<= 3 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2320#false} is VALID [2022-04-08 03:59:36,704 INFO L272 TraceCheckUtils]: 40: Hoare triple {2320#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#false} is VALID [2022-04-08 03:59:36,704 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-08 03:59:36,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-08 03:59:36,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-08 03:59:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 03:59:36,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:59:36,914 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-08 03:59:36,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-08 03:59:36,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-08 03:59:36,915 INFO L272 TraceCheckUtils]: 40: Hoare triple {2320#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#false} is VALID [2022-04-08 03:59:36,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {2344#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2320#false} is VALID [2022-04-08 03:59:36,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2344#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 03:59:36,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:36,916 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2319#true} {2339#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:36,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-08 03:59:36,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-08 03:59:36,917 INFO L272 TraceCheckUtils]: 32: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-08 03:59:36,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:36,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:36,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:36,918 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2319#true} {2334#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:36,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-08 03:59:36,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-08 03:59:36,918 INFO L272 TraceCheckUtils]: 24: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-08 03:59:36,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:36,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {2546#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:36,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {2546#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {2546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:36,920 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2319#true} {2546#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {2546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:36,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-08 03:59:36,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-08 03:59:36,920 INFO L272 TraceCheckUtils]: 16: Hoare triple {2546#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-08 03:59:36,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {2546#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:36,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {2328#(<= main_~n~0 3)} ~i~1 := 0; {2546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:36,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {2327#(<= main_~i~0 3)} assume !(~i~0 < ~n~0); {2328#(<= main_~n~0 3)} is VALID [2022-04-08 03:59:36,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2327#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:36,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {2326#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2326#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:36,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2326#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:36,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2325#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:36,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {2367#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2325#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:36,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {2367#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2367#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:36,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {2319#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2367#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:36,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {2319#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2319#true} is VALID [2022-04-08 03:59:36,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-08 03:59:36,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-08 03:59:36,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-08 03:59:36,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#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(9, 2); {2319#true} is VALID [2022-04-08 03:59:36,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {2319#true} call ULTIMATE.init(); {2319#true} is VALID [2022-04-08 03:59:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 03:59:36,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941754969] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:59:36,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:59:36,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-04-08 03:59:36,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:36,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [549838015] [2022-04-08 03:59:36,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [549838015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:36,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:36,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 03:59:36,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561156518] [2022-04-08 03:59:36,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:36,925 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2022-04-08 03:59:36,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:36,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:36,948 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-08 03:59:36,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 03:59:36,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 03:59:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-08 03:59:36,949 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:37,440 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-04-08 03:59:37,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 03:59:37,440 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2022-04-08 03:59:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:59:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-08 03:59:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-08 03:59:37,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2022-04-08 03:59:37,499 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-08 03:59:37,500 INFO L225 Difference]: With dead ends: 74 [2022-04-08 03:59:37,500 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 03:59:37,501 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2022-04-08 03:59:37,501 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:59:37,501 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 51 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:59:37,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 03:59:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-08 03:59:37,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:59:37,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:37,519 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:37,519 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:37,520 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-08 03:59:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-08 03:59:37,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:37,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:37,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-04-08 03:59:37,520 INFO L87 Difference]: Start difference. First operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-04-08 03:59:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:37,521 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-08 03:59:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-08 03:59:37,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:37,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:37,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:59:37,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:59:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:37,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-04-08 03:59:37,523 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2022-04-08 03:59:37,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:59:37,523 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-04-08 03:59:37,523 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:37,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 50 transitions. [2022-04-08 03:59:37,573 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-08 03:59:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-08 03:59:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 03:59:37,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:37,574 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:37,591 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-08 03:59:37,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:37,775 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:37,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:37,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1186401044, now seen corresponding path program 11 times [2022-04-08 03:59:37,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:37,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2036729032] [2022-04-08 03:59:37,777 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:59:37,778 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:59:37,778 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:59:37,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1186401044, now seen corresponding path program 12 times [2022-04-08 03:59:37,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:37,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824517541] [2022-04-08 03:59:37,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:37,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:37,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:37,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {3009#(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(9, 2); {2979#true} is VALID [2022-04-08 03:59:37,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-08 03:59:37,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-08 03:59:37,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 03:59:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:37,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-08 03:59:37,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-08 03:59:37,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-08 03:59:37,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #68#return; {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:37,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 03:59:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:37,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-08 03:59:37,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-08 03:59:37,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-08 03:59:37,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:37,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-08 03:59:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:37,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-08 03:59:37,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-08 03:59:37,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-08 03:59:37,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:37,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {2979#true} call ULTIMATE.init(); {3009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:59:37,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {3009#(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(9, 2); {2979#true} is VALID [2022-04-08 03:59:37,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-08 03:59:37,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-08 03:59:37,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {2979#true} call #t~ret6 := main(); {2979#true} is VALID [2022-04-08 03:59:37,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {2979#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2979#true} is VALID [2022-04-08 03:59:37,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {2979#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2984#(= main_~i~0 0)} is VALID [2022-04-08 03:59:37,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {2984#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2984#(= main_~i~0 0)} is VALID [2022-04-08 03:59:37,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {2984#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2985#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 03:59:37,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {2985#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2985#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 03:59:37,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {2985#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2986#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:59:37,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {2986#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2986#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:59:37,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {2986#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2987#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:59:37,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {2987#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2988#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:59:37,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {2988#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2989#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} is VALID [2022-04-08 03:59:37,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {2989#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} assume !(~i~0 < ~n~0); {2989#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} is VALID [2022-04-08 03:59:37,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {2989#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} ~i~1 := 0; {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:37,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:37,981 INFO L272 TraceCheckUtils]: 18: Hoare triple {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2979#true} is VALID [2022-04-08 03:59:37,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-08 03:59:37,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-08 03:59:37,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-08 03:59:37,982 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2979#true} {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #68#return; {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:37,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} havoc #t~mem5; {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:37,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:37,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:37,983 INFO L272 TraceCheckUtils]: 26: Hoare triple {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2979#true} is VALID [2022-04-08 03:59:37,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-08 03:59:37,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-08 03:59:37,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-08 03:59:37,984 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2979#true} {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:37,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:37,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:37,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:37,986 INFO L272 TraceCheckUtils]: 34: Hoare triple {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2979#true} is VALID [2022-04-08 03:59:37,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-08 03:59:37,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-08 03:59:37,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-08 03:59:37,987 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2979#true} {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:37,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:37,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3005#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 03:59:37,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {3005#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3006#(= |main_#t~mem5| 0)} is VALID [2022-04-08 03:59:37,989 INFO L272 TraceCheckUtils]: 42: Hoare triple {3006#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:59:37,989 INFO L290 TraceCheckUtils]: 43: Hoare triple {3007#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3008#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:59:37,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {3008#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2980#false} is VALID [2022-04-08 03:59:37,990 INFO L290 TraceCheckUtils]: 45: Hoare triple {2980#false} assume !false; {2980#false} is VALID [2022-04-08 03:59:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 03:59:37,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:37,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824517541] [2022-04-08 03:59:37,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824517541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:37,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559060786] [2022-04-08 03:59:37,991 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:59:37,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:37,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:59:37,991 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-08 03:59:37,993 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-08 03:59:38,038 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 03:59:38,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:59:38,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 03:59:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:38,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:59:38,165 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-08 03:59:41,618 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-08 03:59:41,618 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 23 treesize of output 10 [2022-04-08 03:59:41,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {2979#true} call ULTIMATE.init(); {2979#true} is VALID [2022-04-08 03:59:41,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#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(9, 2); {2979#true} is VALID [2022-04-08 03:59:41,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-08 03:59:41,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-08 03:59:41,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {2979#true} call #t~ret6 := main(); {2979#true} is VALID [2022-04-08 03:59:41,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {2979#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2979#true} is VALID [2022-04-08 03:59:41,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {2979#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3031#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:41,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {3031#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3031#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:41,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {3031#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3038#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:41,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {3038#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3038#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:41,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {3038#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3045#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:41,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {3045#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3045#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:41,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {3045#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3052#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:41,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {3052#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3056#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 3))} is VALID [2022-04-08 03:59:41,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {3056#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3060#(exists ((v_main_~i~0_45 Int)) (and (<= main_~i~0 (+ v_main_~i~0_45 1)) (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0)))} is VALID [2022-04-08 03:59:41,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {3060#(exists ((v_main_~i~0_45 Int)) (and (<= main_~i~0 (+ v_main_~i~0_45 1)) (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0)))} assume !(~i~0 < ~n~0); {3064#(exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1))))} is VALID [2022-04-08 03:59:41,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {3064#(exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1))))} ~i~1 := 0; {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-08 03:59:41,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-08 03:59:41,734 INFO L272 TraceCheckUtils]: 18: Hoare triple {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-08 03:59:41,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} ~cond := #in~cond; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-08 03:59:41,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume !(0 == ~cond); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-08 03:59:41,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume true; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-08 03:59:41,736 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} #68#return; {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-08 03:59:41,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} havoc #t~mem5; {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-08 03:59:41,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-08 03:59:41,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-08 03:59:41,747 INFO L272 TraceCheckUtils]: 26: Hoare triple {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-08 03:59:41,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} ~cond := #in~cond; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-08 03:59:41,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume !(0 == ~cond); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-08 03:59:41,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume true; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-08 03:59:41,751 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} #68#return; {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-08 03:59:41,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} havoc #t~mem5; {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-08 03:59:41,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 03:59:41,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 03:59:41,760 INFO L272 TraceCheckUtils]: 34: Hoare triple {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-08 03:59:41,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} ~cond := #in~cond; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-08 03:59:41,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume !(0 == ~cond); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-08 03:59:41,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume true; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-08 03:59:41,761 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} #68#return; {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 03:59:41,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} havoc #t~mem5; {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 03:59:41,763 INFO L290 TraceCheckUtils]: 40: Hoare triple {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3144#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 03:59:41,763 INFO L290 TraceCheckUtils]: 41: Hoare triple {3144#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3006#(= |main_#t~mem5| 0)} is VALID [2022-04-08 03:59:41,779 INFO L272 TraceCheckUtils]: 42: Hoare triple {3006#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3151#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:59:41,779 INFO L290 TraceCheckUtils]: 43: Hoare triple {3151#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3155#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:59:41,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {3155#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2980#false} is VALID [2022-04-08 03:59:41,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {2980#false} assume !false; {2980#false} is VALID [2022-04-08 03:59:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 03:59:41,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:59:42,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559060786] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:42,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 03:59:42,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2022-04-08 03:59:42,045 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:42,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2036729032] [2022-04-08 03:59:42,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2036729032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:42,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:42,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 03:59:42,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293452980] [2022-04-08 03:59:42,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:42,046 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2022-04-08 03:59:42,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:42,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:42,072 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-08 03:59:42,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 03:59:42,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:42,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 03:59:42,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2022-04-08 03:59:42,074 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:43,049 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-04-08 03:59:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 03:59:43,049 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2022-04-08 03:59:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:59:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-08 03:59:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-08 03:59:43,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 54 transitions. [2022-04-08 03:59:43,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:59:43,096 INFO L225 Difference]: With dead ends: 62 [2022-04-08 03:59:43,096 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 03:59:43,097 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=211, Invalid=1859, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 03:59:43,097 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 03:59:43,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 76 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 03:59:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 03:59:43,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-04-08 03:59:43,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:59:43,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:59:43,114 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:59:43,114 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:59:43,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:43,115 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-08 03:59:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-08 03:59:43,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:43,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:43,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-08 03:59:43,115 INFO L87 Difference]: Start difference. First operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-08 03:59:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:43,117 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-08 03:59:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-08 03:59:43,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:43,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:43,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:59:43,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:59:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:59:43,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-04-08 03:59:43,118 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2022-04-08 03:59:43,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:59:43,118 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-04-08 03:59:43,118 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:59:43,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 58 transitions. [2022-04-08 03:59:43,182 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-08 03:59:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-08 03:59:43,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 03:59:43,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:43,183 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:43,199 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-08 03:59:43,388 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:43,391 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:43,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:43,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1707008786, now seen corresponding path program 13 times [2022-04-08 03:59:43,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:43,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [465025430] [2022-04-08 03:59:43,393 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:59:43,393 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:59:43,393 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:59:43,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1707008786, now seen corresponding path program 14 times [2022-04-08 03:59:43,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:43,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381036303] [2022-04-08 03:59:43,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:43,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:43,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:43,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {3605#(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(9, 2); {3573#true} is VALID [2022-04-08 03:59:43,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:43,551 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-08 03:59:43,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 03:59:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:43,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:43,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:43,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:43,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} #68#return; {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-08 03:59:43,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 03:59:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:43,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:43,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:43,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:43,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3589#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:43,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-08 03:59:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:43,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:43,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:43,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:43,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3594#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:43,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-08 03:59:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:43,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:43,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:43,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:43,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3599#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:43,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:59:43,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {3605#(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(9, 2); {3573#true} is VALID [2022-04-08 03:59:43,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:43,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-08 03:59:43,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-08 03:59:43,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {3573#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3573#true} is VALID [2022-04-08 03:59:43,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {3573#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3578#(= main_~i~0 0)} is VALID [2022-04-08 03:59:43,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {3578#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3578#(= main_~i~0 0)} is VALID [2022-04-08 03:59:43,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {3578#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3579#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:43,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {3579#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3579#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:43,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {3579#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3580#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:43,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {3580#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3580#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:43,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {3580#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3581#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:43,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {3581#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3581#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:43,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {3581#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3582#(<= main_~i~0 4)} is VALID [2022-04-08 03:59:43,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {3582#(<= main_~i~0 4)} assume !(~i~0 < ~n~0); {3583#(<= main_~n~0 4)} is VALID [2022-04-08 03:59:43,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {3583#(<= main_~n~0 4)} ~i~1 := 0; {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-08 03:59:43,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-08 03:59:43,575 INFO L272 TraceCheckUtils]: 18: Hoare triple {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-08 03:59:43,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:43,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:43,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:43,576 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3573#true} {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} #68#return; {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-08 03:59:43,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} havoc #t~mem5; {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-08 03:59:43,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:43,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:43,577 INFO L272 TraceCheckUtils]: 26: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-08 03:59:43,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:43,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:43,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:43,578 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3573#true} {3589#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:43,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:43,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:43,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:43,579 INFO L272 TraceCheckUtils]: 34: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-08 03:59:43,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:43,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:43,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:43,581 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3573#true} {3594#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:43,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:43,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:43,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:43,582 INFO L272 TraceCheckUtils]: 42: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-08 03:59:43,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:43,583 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:43,583 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:43,583 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3573#true} {3599#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:43,583 INFO L290 TraceCheckUtils]: 47: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:43,584 INFO L290 TraceCheckUtils]: 48: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3604#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 03:59:43,584 INFO L290 TraceCheckUtils]: 49: Hoare triple {3604#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3574#false} is VALID [2022-04-08 03:59:43,584 INFO L272 TraceCheckUtils]: 50: Hoare triple {3574#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3574#false} is VALID [2022-04-08 03:59:43,584 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-08 03:59:43,584 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-08 03:59:43,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-08 03:59:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 27 proven. 29 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 03:59:43,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:43,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381036303] [2022-04-08 03:59:43,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381036303] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:43,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936846651] [2022-04-08 03:59:43,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:59:43,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:43,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:59:43,586 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-08 03:59:43,589 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-08 03:59:43,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:59:43,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:59:43,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 03:59:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:43,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:59:43,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3573#true} is VALID [2022-04-08 03:59:43,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#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(9, 2); {3573#true} is VALID [2022-04-08 03:59:43,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:43,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-08 03:59:43,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-08 03:59:43,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {3573#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3573#true} is VALID [2022-04-08 03:59:43,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {3573#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3627#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:43,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {3627#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3627#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:43,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {3627#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3579#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:43,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {3579#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3579#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:43,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {3579#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3580#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:43,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {3580#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3580#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:43,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {3580#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3581#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:43,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {3581#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3581#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:43,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {3581#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3582#(<= main_~i~0 4)} is VALID [2022-04-08 03:59:43,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {3582#(<= main_~i~0 4)} assume !(~i~0 < ~n~0); {3583#(<= main_~n~0 4)} is VALID [2022-04-08 03:59:43,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {3583#(<= main_~n~0 4)} ~i~1 := 0; {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:43,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:43,998 INFO L272 TraceCheckUtils]: 18: Hoare triple {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-08 03:59:43,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:43,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:43,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:43,998 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3573#true} {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} #68#return; {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:43,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} havoc #t~mem5; {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:43,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:43,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:44,000 INFO L272 TraceCheckUtils]: 26: Hoare triple {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-08 03:59:44,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:44,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:44,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:44,000 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3573#true} {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} #68#return; {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:44,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} havoc #t~mem5; {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:44,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:44,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:44,001 INFO L272 TraceCheckUtils]: 34: Hoare triple {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-08 03:59:44,002 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:44,002 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:44,002 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:44,015 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3573#true} {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} #68#return; {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:44,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} havoc #t~mem5; {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:44,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:44,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:44,020 INFO L272 TraceCheckUtils]: 42: Hoare triple {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-08 03:59:44,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:44,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:44,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:44,021 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3573#true} {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} #68#return; {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:44,021 INFO L290 TraceCheckUtils]: 47: Hoare triple {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} havoc #t~mem5; {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:44,022 INFO L290 TraceCheckUtils]: 48: Hoare triple {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3758#(and (<= 4 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-08 03:59:44,022 INFO L290 TraceCheckUtils]: 49: Hoare triple {3758#(and (<= 4 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3574#false} is VALID [2022-04-08 03:59:44,022 INFO L272 TraceCheckUtils]: 50: Hoare triple {3574#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3574#false} is VALID [2022-04-08 03:59:44,022 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-08 03:59:44,022 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-08 03:59:44,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-08 03:59:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 40 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 03:59:44,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:59:44,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-08 03:59:44,267 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-08 03:59:44,267 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-08 03:59:44,267 INFO L272 TraceCheckUtils]: 50: Hoare triple {3574#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3574#false} is VALID [2022-04-08 03:59:44,268 INFO L290 TraceCheckUtils]: 49: Hoare triple {3604#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3574#false} is VALID [2022-04-08 03:59:44,268 INFO L290 TraceCheckUtils]: 48: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3604#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 03:59:44,268 INFO L290 TraceCheckUtils]: 47: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:44,269 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3573#true} {3599#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:44,269 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:44,269 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:44,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:44,269 INFO L272 TraceCheckUtils]: 42: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-08 03:59:44,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:44,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:44,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:44,270 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3573#true} {3594#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:44,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:44,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:44,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:44,271 INFO L272 TraceCheckUtils]: 34: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-08 03:59:44,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:44,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:44,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:44,272 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3573#true} {3589#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:44,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:44,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:44,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:44,272 INFO L272 TraceCheckUtils]: 26: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-08 03:59:44,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:44,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {3861#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:44,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {3861#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {3861#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 03:59:44,274 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3573#true} {3861#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {3861#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 03:59:44,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:44,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-08 03:59:44,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-08 03:59:44,274 INFO L272 TraceCheckUtils]: 18: Hoare triple {3861#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-08 03:59:44,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {3861#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3861#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 03:59:44,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {3583#(<= main_~n~0 4)} ~i~1 := 0; {3861#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 03:59:44,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {3582#(<= main_~i~0 4)} assume !(~i~0 < ~n~0); {3583#(<= main_~n~0 4)} is VALID [2022-04-08 03:59:44,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {3581#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3582#(<= main_~i~0 4)} is VALID [2022-04-08 03:59:44,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {3581#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3581#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:44,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {3580#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3581#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:44,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {3580#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3580#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:44,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {3579#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3580#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:44,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {3579#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3579#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:44,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {3627#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3579#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:44,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {3627#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3627#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:44,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {3573#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3627#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:44,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {3573#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3573#true} is VALID [2022-04-08 03:59:44,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-08 03:59:44,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-08 03:59:44,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-08 03:59:44,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#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(9, 2); {3573#true} is VALID [2022-04-08 03:59:44,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3573#true} is VALID [2022-04-08 03:59:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 40 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 03:59:44,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936846651] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:59:44,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:59:44,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-04-08 03:59:44,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:44,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [465025430] [2022-04-08 03:59:44,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [465025430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:44,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:44,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 03:59:44,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971755450] [2022-04-08 03:59:44,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:44,280 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 54 [2022-04-08 03:59:44,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:44,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:44,331 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-08 03:59:44,332 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 03:59:44,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:44,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 03:59:44,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-04-08 03:59:44,332 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:44,849 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-04-08 03:59:44,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 03:59:44,849 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 54 [2022-04-08 03:59:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:59:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-08 03:59:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-08 03:59:44,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-08 03:59:44,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:59:44,901 INFO L225 Difference]: With dead ends: 88 [2022-04-08 03:59:44,901 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 03:59:44,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2022-04-08 03:59:44,902 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:59:44,902 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 58 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:59:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 03:59:44,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-08 03:59:44,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:59:44,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:59:44,927 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:59:44,927 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:59:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:44,928 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-08 03:59:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-08 03:59:44,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:44,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:44,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-08 03:59:44,929 INFO L87 Difference]: Start difference. First operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-08 03:59:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:44,930 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-08 03:59:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-08 03:59:44,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:44,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:44,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:59:44,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:59:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:59:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2022-04-08 03:59:44,932 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2022-04-08 03:59:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:59:44,932 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2022-04-08 03:59:44,932 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:44,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 60 transitions. [2022-04-08 03:59:44,990 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-08 03:59:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-08 03:59:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-08 03:59:44,991 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:44,991 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:45,009 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-08 03:59:45,209 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,SelfDestructingSolverStorable8 [2022-04-08 03:59:45,210 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:45,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:45,210 INFO L85 PathProgramCache]: Analyzing trace with hash -275659828, now seen corresponding path program 15 times [2022-04-08 03:59:45,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:45,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1861665338] [2022-04-08 03:59:45,212 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:59:45,212 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:59:45,212 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:59:45,212 INFO L85 PathProgramCache]: Analyzing trace with hash -275659828, now seen corresponding path program 16 times [2022-04-08 03:59:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:45,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371804183] [2022-04-08 03:59:45,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:45,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:45,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:45,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {4408#(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(9, 2); {4372#true} is VALID [2022-04-08 03:59:45,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-08 03:59:45,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-08 03:59:45,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-08 03:59:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:45,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-08 03:59:45,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-08 03:59:45,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-08 03:59:45,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #68#return; {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:45,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-08 03:59:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:45,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-08 03:59:45,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-08 03:59:45,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-08 03:59:45,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 03:59:45,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-08 03:59:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:45,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-08 03:59:45,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-08 03:59:45,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-08 03:59:45,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:45,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-08 03:59:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:45,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-08 03:59:45,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-08 03:59:45,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-08 03:59:45,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:45,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {4372#true} call ULTIMATE.init(); {4408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:59:45,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {4408#(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(9, 2); {4372#true} is VALID [2022-04-08 03:59:45,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-08 03:59:45,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-08 03:59:45,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret6 := main(); {4372#true} is VALID [2022-04-08 03:59:45,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {4372#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4372#true} is VALID [2022-04-08 03:59:45,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {4372#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4377#(= main_~i~0 0)} is VALID [2022-04-08 03:59:45,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {4377#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4377#(= main_~i~0 0)} is VALID [2022-04-08 03:59:45,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {4377#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4378#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 03:59:45,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {4378#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4378#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 03:59:45,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {4378#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4379#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:59:45,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {4379#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4379#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:59:45,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {4379#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4380#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:59:45,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {4380#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4380#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:59:45,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {4380#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4381#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 03:59:45,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {4381#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4382#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 03:59:45,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {4382#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-08 03:59:45,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {4383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} assume !(~i~0 < ~n~0); {4383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-08 03:59:45,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {4383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} ~i~1 := 0; {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:45,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:45,453 INFO L272 TraceCheckUtils]: 20: Hoare triple {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4372#true} is VALID [2022-04-08 03:59:45,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-08 03:59:45,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-08 03:59:45,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-08 03:59:45,454 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4372#true} {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #68#return; {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:45,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} havoc #t~mem5; {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:45,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 03:59:45,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 03:59:45,455 INFO L272 TraceCheckUtils]: 28: Hoare triple {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4372#true} is VALID [2022-04-08 03:59:45,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-08 03:59:45,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-08 03:59:45,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-08 03:59:45,456 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4372#true} {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 03:59:45,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 03:59:45,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:45,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:45,457 INFO L272 TraceCheckUtils]: 36: Hoare triple {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4372#true} is VALID [2022-04-08 03:59:45,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-08 03:59:45,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-08 03:59:45,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-08 03:59:45,458 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4372#true} {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:45,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:45,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:45,459 INFO L290 TraceCheckUtils]: 43: Hoare triple {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:45,459 INFO L272 TraceCheckUtils]: 44: Hoare triple {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4372#true} is VALID [2022-04-08 03:59:45,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-08 03:59:45,459 INFO L290 TraceCheckUtils]: 46: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-08 03:59:45,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-08 03:59:45,460 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4372#true} {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:45,460 INFO L290 TraceCheckUtils]: 49: Hoare triple {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:45,461 INFO L290 TraceCheckUtils]: 50: Hoare triple {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4404#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 03:59:45,462 INFO L290 TraceCheckUtils]: 51: Hoare triple {4404#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4405#(= |main_#t~mem5| 0)} is VALID [2022-04-08 03:59:45,463 INFO L272 TraceCheckUtils]: 52: Hoare triple {4405#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4406#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:59:45,463 INFO L290 TraceCheckUtils]: 53: Hoare triple {4406#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4407#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:59:45,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {4407#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4373#false} is VALID [2022-04-08 03:59:45,463 INFO L290 TraceCheckUtils]: 55: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2022-04-08 03:59:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 03:59:45,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:45,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371804183] [2022-04-08 03:59:45,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371804183] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:45,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121934800] [2022-04-08 03:59:45,464 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:59:45,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:45,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:59:45,465 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-08 03:59:45,465 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-08 03:59:45,517 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:59:45,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:59:45,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 03:59:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:45,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:59:45,655 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-08 03:59:49,042 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-08 03:59:49,043 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 23 treesize of output 10 [2022-04-08 03:59:49,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {4372#true} call ULTIMATE.init(); {4372#true} is VALID [2022-04-08 03:59:49,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#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(9, 2); {4372#true} is VALID [2022-04-08 03:59:49,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-08 03:59:49,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-08 03:59:49,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret6 := main(); {4372#true} is VALID [2022-04-08 03:59:49,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {4372#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4372#true} is VALID [2022-04-08 03:59:49,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {4372#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4430#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:49,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {4430#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4430#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:49,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {4430#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4437#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:49,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {4437#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4437#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:49,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {4437#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4444#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:49,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {4444#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4444#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:49,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {4444#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4451#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:49,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {4451#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4451#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:49,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {4451#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4458#(<= main_~i~0 4)} is VALID [2022-04-08 03:59:49,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {4458#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4462#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4))} is VALID [2022-04-08 03:59:49,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {4462#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4466#(exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~i~0 (+ v_main_~i~0_63 1))))} is VALID [2022-04-08 03:59:49,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {4466#(exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~i~0 (+ v_main_~i~0_63 1))))} assume !(~i~0 < ~n~0); {4470#(exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1))))} is VALID [2022-04-08 03:59:49,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {4470#(exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1))))} ~i~1 := 0; {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-08 03:59:49,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-08 03:59:49,137 INFO L272 TraceCheckUtils]: 20: Hoare triple {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} ~cond := #in~cond; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume !(0 == ~cond); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume true; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,139 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #68#return; {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-08 03:59:49,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} havoc #t~mem5; {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-08 03:59:49,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-08 03:59:49,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-08 03:59:49,142 INFO L272 TraceCheckUtils]: 28: Hoare triple {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} ~cond := #in~cond; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume !(0 == ~cond); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume true; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,144 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #68#return; {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-08 03:59:49,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} havoc #t~mem5; {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-08 03:59:49,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-08 03:59:49,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-08 03:59:49,152 INFO L272 TraceCheckUtils]: 36: Hoare triple {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} ~cond := #in~cond; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume !(0 == ~cond); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume true; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,154 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #68#return; {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-08 03:59:49,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} havoc #t~mem5; {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-08 03:59:49,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 03:59:49,156 INFO L290 TraceCheckUtils]: 43: Hoare triple {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 03:59:49,159 INFO L272 TraceCheckUtils]: 44: Hoare triple {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} ~cond := #in~cond; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,160 INFO L290 TraceCheckUtils]: 46: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume !(0 == ~cond); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,160 INFO L290 TraceCheckUtils]: 47: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume true; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-08 03:59:49,161 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} #68#return; {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 03:59:49,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} havoc #t~mem5; {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 03:59:49,163 INFO L290 TraceCheckUtils]: 50: Hoare triple {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4575#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-08 03:59:49,163 INFO L290 TraceCheckUtils]: 51: Hoare triple {4575#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4405#(= |main_#t~mem5| 0)} is VALID [2022-04-08 03:59:49,164 INFO L272 TraceCheckUtils]: 52: Hoare triple {4405#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4582#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:59:49,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {4582#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4586#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:59:49,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {4586#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4373#false} is VALID [2022-04-08 03:59:49,165 INFO L290 TraceCheckUtils]: 55: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2022-04-08 03:59:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 37 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 03:59:49,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:59:49,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121934800] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:49,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 03:59:49,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2022-04-08 03:59:49,454 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:49,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1861665338] [2022-04-08 03:59:49,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1861665338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:49,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:49,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 03:59:49,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453246436] [2022-04-08 03:59:49,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:49,455 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 56 [2022-04-08 03:59:49,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:49,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:49,489 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-08 03:59:49,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 03:59:49,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:49,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 03:59:49,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 03:59:49,490 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:50,829 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2022-04-08 03:59:50,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 03:59:50,829 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 56 [2022-04-08 03:59:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:59:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2022-04-08 03:59:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2022-04-08 03:59:50,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 61 transitions. [2022-04-08 03:59:50,882 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-08 03:59:50,883 INFO L225 Difference]: With dead ends: 72 [2022-04-08 03:59:50,883 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 03:59:50,884 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=251, Invalid=2401, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 03:59:50,884 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 03:59:50,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 87 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 03:59:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 03:59:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-04-08 03:59:50,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:59:50,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 03:59:50,911 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 03:59:50,911 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 03:59:50,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:50,913 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-08 03:59:50,913 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-08 03:59:50,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:50,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:50,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 70 states. [2022-04-08 03:59:50,913 INFO L87 Difference]: Start difference. First operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 70 states. [2022-04-08 03:59:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:50,914 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-08 03:59:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-08 03:59:50,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:50,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:50,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:59:50,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:59:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 03:59:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-08 03:59:50,916 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2022-04-08 03:59:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:59:50,916 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-08 03:59:50,916 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:59:50,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 68 transitions. [2022-04-08 03:59:51,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:59:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-08 03:59:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 03:59:51,011 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:51,011 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:51,027 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-08 03:59:51,212 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 03:59:51,212 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:51,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:51,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1978425946, now seen corresponding path program 17 times [2022-04-08 03:59:51,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:51,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [703167622] [2022-04-08 03:59:51,216 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:59:51,216 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:59:51,216 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:59:51,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1978425946, now seen corresponding path program 18 times [2022-04-08 03:59:51,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:51,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031449232] [2022-04-08 03:59:51,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:51,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:51,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:51,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {5106#(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(9, 2); {5068#true} is VALID [2022-04-08 03:59:51,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,348 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-08 03:59:51,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-08 03:59:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:51,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} #68#return; {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-08 03:59:51,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-08 03:59:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:51,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5085#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 03:59:51,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-08 03:59:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:51,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5090#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-08 03:59:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:51,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5095#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:51,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-08 03:59:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:51,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5100#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:51,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:59:51,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {5106#(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(9, 2); {5068#true} is VALID [2022-04-08 03:59:51,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-08 03:59:51,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-08 03:59:51,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {5068#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5068#true} is VALID [2022-04-08 03:59:51,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {5068#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {5073#(= main_~i~0 0)} is VALID [2022-04-08 03:59:51,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {5073#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5073#(= main_~i~0 0)} is VALID [2022-04-08 03:59:51,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {5073#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5074#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:51,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {5074#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5074#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:51,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {5074#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5075#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:51,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {5075#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5075#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:51,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {5075#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5076#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:51,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {5076#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5076#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:51,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {5076#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5077#(<= main_~i~0 4)} is VALID [2022-04-08 03:59:51,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {5077#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5077#(<= main_~i~0 4)} is VALID [2022-04-08 03:59:51,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {5077#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5078#(<= main_~i~0 5)} is VALID [2022-04-08 03:59:51,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {5078#(<= main_~i~0 5)} assume !(~i~0 < ~n~0); {5079#(<= main_~n~0 5)} is VALID [2022-04-08 03:59:51,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#(<= main_~n~0 5)} ~i~1 := 0; {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-08 03:59:51,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-08 03:59:51,386 INFO L272 TraceCheckUtils]: 20: Hoare triple {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:51,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,386 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5068#true} {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} #68#return; {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-08 03:59:51,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} havoc #t~mem5; {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-08 03:59:51,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 03:59:51,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 03:59:51,387 INFO L272 TraceCheckUtils]: 28: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:51,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,388 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5068#true} {5085#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 03:59:51,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 03:59:51,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:51,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:51,389 INFO L272 TraceCheckUtils]: 36: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:51,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,390 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5068#true} {5090#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:51,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:51,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:51,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:51,391 INFO L272 TraceCheckUtils]: 44: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:51,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,392 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5068#true} {5095#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:51,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:51,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:51,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:51,393 INFO L272 TraceCheckUtils]: 52: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:51,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,393 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,393 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,393 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5068#true} {5100#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:51,394 INFO L290 TraceCheckUtils]: 57: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:51,394 INFO L290 TraceCheckUtils]: 58: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5105#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 03:59:51,394 INFO L290 TraceCheckUtils]: 59: Hoare triple {5105#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5069#false} is VALID [2022-04-08 03:59:51,394 INFO L272 TraceCheckUtils]: 60: Hoare triple {5069#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5069#false} is VALID [2022-04-08 03:59:51,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-08 03:59:51,395 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-08 03:59:51,395 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-08 03:59:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 03:59:51,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:51,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031449232] [2022-04-08 03:59:51,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031449232] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:51,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778530131] [2022-04-08 03:59:51,395 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:59:51,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:51,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:59:51,396 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-08 03:59:51,398 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-08 03:59:51,450 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 03:59:51,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:59:51,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 03:59:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:51,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:59:51,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5068#true} is VALID [2022-04-08 03:59:51,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#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(9, 2); {5068#true} is VALID [2022-04-08 03:59:51,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-08 03:59:51,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-08 03:59:51,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {5068#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5068#true} is VALID [2022-04-08 03:59:51,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {5068#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {5128#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:51,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {5128#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5128#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:51,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {5128#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5074#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:51,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {5074#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5074#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:51,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {5074#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5075#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:51,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {5075#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5075#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:51,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {5075#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5076#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:51,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {5076#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5076#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:51,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {5076#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5077#(<= main_~i~0 4)} is VALID [2022-04-08 03:59:51,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {5077#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5077#(<= main_~i~0 4)} is VALID [2022-04-08 03:59:51,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {5077#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5078#(<= main_~i~0 5)} is VALID [2022-04-08 03:59:51,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {5078#(<= main_~i~0 5)} assume !(~i~0 < ~n~0); {5079#(<= main_~n~0 5)} is VALID [2022-04-08 03:59:51,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#(<= main_~n~0 5)} ~i~1 := 0; {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-08 03:59:51,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-08 03:59:51,913 INFO L272 TraceCheckUtils]: 20: Hoare triple {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:51,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,913 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5068#true} {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} #68#return; {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-08 03:59:51,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} havoc #t~mem5; {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-08 03:59:51,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-08 03:59:51,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-08 03:59:51,915 INFO L272 TraceCheckUtils]: 28: Hoare triple {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:51,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,915 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5068#true} {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} #68#return; {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-08 03:59:51,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} havoc #t~mem5; {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-08 03:59:51,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2022-04-08 03:59:51,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2022-04-08 03:59:51,916 INFO L272 TraceCheckUtils]: 36: Hoare triple {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:51,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,917 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,917 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5068#true} {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} #68#return; {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2022-04-08 03:59:51,917 INFO L290 TraceCheckUtils]: 41: Hoare triple {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} havoc #t~mem5; {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2022-04-08 03:59:51,918 INFO L290 TraceCheckUtils]: 42: Hoare triple {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2022-04-08 03:59:51,918 INFO L290 TraceCheckUtils]: 43: Hoare triple {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2022-04-08 03:59:51,918 INFO L272 TraceCheckUtils]: 44: Hoare triple {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:51,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,919 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,919 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,919 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5068#true} {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} #68#return; {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2022-04-08 03:59:51,919 INFO L290 TraceCheckUtils]: 49: Hoare triple {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} havoc #t~mem5; {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2022-04-08 03:59:51,920 INFO L290 TraceCheckUtils]: 50: Hoare triple {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} is VALID [2022-04-08 03:59:51,920 INFO L290 TraceCheckUtils]: 51: Hoare triple {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} is VALID [2022-04-08 03:59:51,920 INFO L272 TraceCheckUtils]: 52: Hoare triple {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:51,920 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:51,920 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:51,920 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:51,921 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5068#true} {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} #68#return; {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} is VALID [2022-04-08 03:59:51,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} havoc #t~mem5; {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} is VALID [2022-04-08 03:59:51,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5290#(and (<= 5 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-08 03:59:51,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {5290#(and (<= 5 main_~i~1) (<= main_~n~0 5))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5069#false} is VALID [2022-04-08 03:59:51,922 INFO L272 TraceCheckUtils]: 60: Hoare triple {5069#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5069#false} is VALID [2022-04-08 03:59:51,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-08 03:59:51,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-08 03:59:51,922 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-08 03:59:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 60 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 03:59:51,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:59:52,226 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-08 03:59:52,226 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-08 03:59:52,227 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-08 03:59:52,227 INFO L272 TraceCheckUtils]: 60: Hoare triple {5069#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5069#false} is VALID [2022-04-08 03:59:52,227 INFO L290 TraceCheckUtils]: 59: Hoare triple {5105#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5069#false} is VALID [2022-04-08 03:59:52,228 INFO L290 TraceCheckUtils]: 58: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5105#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 03:59:52,228 INFO L290 TraceCheckUtils]: 57: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:52,228 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5068#true} {5100#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:52,229 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:52,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:52,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:52,229 INFO L272 TraceCheckUtils]: 52: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:52,229 INFO L290 TraceCheckUtils]: 51: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:52,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 03:59:52,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:52,230 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5068#true} {5095#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:52,231 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:52,231 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:52,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:52,231 INFO L272 TraceCheckUtils]: 44: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:52,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:52,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 03:59:52,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:52,232 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5068#true} {5090#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:52,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:52,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:52,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:52,233 INFO L272 TraceCheckUtils]: 36: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:52,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:52,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 03:59:52,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 03:59:52,235 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5068#true} {5085#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 03:59:52,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:52,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:52,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:52,235 INFO L272 TraceCheckUtils]: 28: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:52,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 03:59:52,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {5417#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 03:59:52,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {5417#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {5417#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 03:59:52,237 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5068#true} {5417#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {5417#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 03:59:52,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:52,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-08 03:59:52,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-08 03:59:52,237 INFO L272 TraceCheckUtils]: 20: Hoare triple {5417#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-08 03:59:52,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {5417#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5417#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 03:59:52,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#(<= main_~n~0 5)} ~i~1 := 0; {5417#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 03:59:52,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {5078#(<= main_~i~0 5)} assume !(~i~0 < ~n~0); {5079#(<= main_~n~0 5)} is VALID [2022-04-08 03:59:52,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {5077#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5078#(<= main_~i~0 5)} is VALID [2022-04-08 03:59:52,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {5077#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5077#(<= main_~i~0 4)} is VALID [2022-04-08 03:59:52,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {5076#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5077#(<= main_~i~0 4)} is VALID [2022-04-08 03:59:52,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {5076#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5076#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:52,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {5075#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5076#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:52,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {5075#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5075#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:52,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {5074#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5075#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:52,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {5074#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5074#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:52,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {5128#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5074#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:52,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {5128#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5128#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:52,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {5068#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {5128#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:52,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {5068#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5068#true} is VALID [2022-04-08 03:59:52,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-08 03:59:52,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-08 03:59:52,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-08 03:59:52,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#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(9, 2); {5068#true} is VALID [2022-04-08 03:59:52,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5068#true} is VALID [2022-04-08 03:59:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 60 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 03:59:52,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778530131] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:59:52,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:59:52,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-04-08 03:59:52,243 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:52,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [703167622] [2022-04-08 03:59:52,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [703167622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:52,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:52,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 03:59:52,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255988108] [2022-04-08 03:59:52,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:52,244 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2022-04-08 03:59:52,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:52,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:59:52,284 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-08 03:59:52,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 03:59:52,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:52,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 03:59:52,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2022-04-08 03:59:52,285 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:59:52,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:52,927 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-08 03:59:52,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 03:59:52,927 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2022-04-08 03:59:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:59:52,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:59:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-08 03:59:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:59:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-08 03:59:52,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 71 transitions. [2022-04-08 03:59:52,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:59:52,992 INFO L225 Difference]: With dead ends: 102 [2022-04-08 03:59:52,992 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 03:59:52,993 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 03:59:52,993 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 42 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:59:52,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 50 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:59:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 03:59:53,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-08 03:59:53,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:59:53,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 03:59:53,017 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 03:59:53,017 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 03:59:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:53,018 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-08 03:59:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-08 03:59:53,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:53,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:53,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 70 states. [2022-04-08 03:59:53,018 INFO L87 Difference]: Start difference. First operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 70 states. [2022-04-08 03:59:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:53,019 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-08 03:59:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-08 03:59:53,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:53,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:53,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:59:53,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:59:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 03:59:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-04-08 03:59:53,021 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2022-04-08 03:59:53,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:59:53,021 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-04-08 03:59:53,021 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:59:53,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 70 transitions. [2022-04-08 03:59:53,100 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-08 03:59:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-08 03:59:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 03:59:53,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:53,101 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:53,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 03:59:53,301 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,SelfDestructingSolverStorable10 [2022-04-08 03:59:53,302 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash -442513660, now seen corresponding path program 19 times [2022-04-08 03:59:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:53,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [881726327] [2022-04-08 03:59:53,304 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:59:53,304 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:59:53,304 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:59:53,304 INFO L85 PathProgramCache]: Analyzing trace with hash -442513660, now seen corresponding path program 20 times [2022-04-08 03:59:53,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:53,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719584972] [2022-04-08 03:59:53,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:53,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:53,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:53,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {6048#(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(9, 2); {6006#true} is VALID [2022-04-08 03:59:53,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 03:59:53,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-08 03:59:53,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 03:59:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:53,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 03:59:53,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 03:59:53,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 03:59:53,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:53,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-08 03:59:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:53,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 03:59:53,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 03:59:53,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 03:59:53,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 03:59:53,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 03:59:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:53,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 03:59:53,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 03:59:53,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 03:59:53,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 03:59:53,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-08 03:59:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:53,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 03:59:53,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 03:59:53,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 03:59:53,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:53,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-08 03:59:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:53,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 03:59:53,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 03:59:53,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 03:59:53,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:53,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {6006#true} call ULTIMATE.init(); {6048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:59:53,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {6048#(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(9, 2); {6006#true} is VALID [2022-04-08 03:59:53,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 03:59:53,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-08 03:59:53,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {6006#true} call #t~ret6 := main(); {6006#true} is VALID [2022-04-08 03:59:53,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {6006#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6006#true} is VALID [2022-04-08 03:59:53,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {6006#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6011#(= main_~i~0 0)} is VALID [2022-04-08 03:59:53,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {6011#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6011#(= main_~i~0 0)} is VALID [2022-04-08 03:59:53,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {6011#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6012#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 03:59:53,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {6012#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6012#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 03:59:53,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {6012#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6013#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:59:53,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {6013#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6013#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 03:59:53,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {6013#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6014#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:59:53,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {6014#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6014#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 03:59:53,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {6014#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6015#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 03:59:53,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {6015#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6015#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 03:59:53,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {6015#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6016#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 03:59:53,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {6016#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6017#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 03:59:53,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {6017#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-08 03:59:53,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {6018#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} assume !(~i~0 < ~n~0); {6018#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-08 03:59:53,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {6018#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} ~i~1 := 0; {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:53,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:53,600 INFO L272 TraceCheckUtils]: 22: Hoare triple {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-08 03:59:53,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 03:59:53,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 03:59:53,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 03:59:53,601 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6006#true} {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:53,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} havoc #t~mem5; {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-08 03:59:53,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 03:59:53,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 03:59:53,602 INFO L272 TraceCheckUtils]: 30: Hoare triple {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-08 03:59:53,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 03:59:53,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 03:59:53,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 03:59:53,603 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6006#true} {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 03:59:53,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 03:59:53,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 03:59:53,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 03:59:53,604 INFO L272 TraceCheckUtils]: 38: Hoare triple {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-08 03:59:53,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 03:59:53,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 03:59:53,604 INFO L290 TraceCheckUtils]: 41: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 03:59:53,605 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6006#true} {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 03:59:53,605 INFO L290 TraceCheckUtils]: 43: Hoare triple {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 03:59:53,606 INFO L290 TraceCheckUtils]: 44: Hoare triple {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:53,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:53,606 INFO L272 TraceCheckUtils]: 46: Hoare triple {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-08 03:59:53,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 03:59:53,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 03:59:53,606 INFO L290 TraceCheckUtils]: 49: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 03:59:53,607 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6006#true} {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:53,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 03:59:53,608 INFO L290 TraceCheckUtils]: 52: Hoare triple {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:53,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:53,608 INFO L272 TraceCheckUtils]: 54: Hoare triple {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-08 03:59:53,608 INFO L290 TraceCheckUtils]: 55: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 03:59:53,608 INFO L290 TraceCheckUtils]: 56: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 03:59:53,608 INFO L290 TraceCheckUtils]: 57: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 03:59:53,609 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6006#true} {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:53,609 INFO L290 TraceCheckUtils]: 59: Hoare triple {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 03:59:53,610 INFO L290 TraceCheckUtils]: 60: Hoare triple {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6044#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 03:59:53,610 INFO L290 TraceCheckUtils]: 61: Hoare triple {6044#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6045#(= |main_#t~mem5| 0)} is VALID [2022-04-08 03:59:53,610 INFO L272 TraceCheckUtils]: 62: Hoare triple {6045#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6046#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:59:53,611 INFO L290 TraceCheckUtils]: 63: Hoare triple {6046#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6047#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:59:53,611 INFO L290 TraceCheckUtils]: 64: Hoare triple {6047#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6007#false} is VALID [2022-04-08 03:59:53,611 INFO L290 TraceCheckUtils]: 65: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2022-04-08 03:59:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 10 proven. 86 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 03:59:53,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:53,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719584972] [2022-04-08 03:59:53,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719584972] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:53,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108645321] [2022-04-08 03:59:53,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:59:53,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:59:53,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:59:53,613 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-08 03:59:53,614 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-08 03:59:53,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:59:53,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:59:53,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 03:59:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:53,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:59:53,839 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-08 03:59:57,918 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-08 03:59:57,919 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 23 treesize of output 10 [2022-04-08 03:59:58,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {6006#true} call ULTIMATE.init(); {6006#true} is VALID [2022-04-08 03:59:58,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#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(9, 2); {6006#true} is VALID [2022-04-08 03:59:58,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 03:59:58,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-08 03:59:58,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {6006#true} call #t~ret6 := main(); {6006#true} is VALID [2022-04-08 03:59:58,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {6006#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6006#true} is VALID [2022-04-08 03:59:58,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {6006#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6070#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:58,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {6070#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6070#(<= main_~i~0 0)} is VALID [2022-04-08 03:59:58,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {6070#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6077#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:58,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {6077#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6077#(<= main_~i~0 1)} is VALID [2022-04-08 03:59:58,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {6077#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6084#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:58,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {6084#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6084#(<= main_~i~0 2)} is VALID [2022-04-08 03:59:58,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {6084#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6091#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:58,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {6091#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6091#(<= main_~i~0 3)} is VALID [2022-04-08 03:59:58,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {6091#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6098#(<= main_~i~0 4)} is VALID [2022-04-08 03:59:58,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {6098#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6098#(<= main_~i~0 4)} is VALID [2022-04-08 03:59:58,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {6098#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6105#(<= main_~i~0 5)} is VALID [2022-04-08 03:59:58,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {6105#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6109#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5))} is VALID [2022-04-08 03:59:58,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {6109#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6113#(exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~i~0 (+ v_main_~i~0_84 1))))} is VALID [2022-04-08 03:59:58,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {6113#(exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~i~0 (+ v_main_~i~0_84 1))))} assume !(~i~0 < ~n~0); {6117#(exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1))))} is VALID [2022-04-08 03:59:58,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {6117#(exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1))))} ~i~1 := 0; {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-08 03:59:58,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-08 03:59:58,017 INFO L272 TraceCheckUtils]: 22: Hoare triple {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,019 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} #68#return; {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-08 03:59:58,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} havoc #t~mem5; {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-08 03:59:58,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-08 03:59:58,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-08 03:59:58,026 INFO L272 TraceCheckUtils]: 30: Hoare triple {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,027 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} #68#return; {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-08 03:59:58,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} havoc #t~mem5; {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-08 03:59:58,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 03:59:58,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 03:59:58,032 INFO L272 TraceCheckUtils]: 38: Hoare triple {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,033 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} #68#return; {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 03:59:58,034 INFO L290 TraceCheckUtils]: 43: Hoare triple {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} havoc #t~mem5; {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 03:59:58,034 INFO L290 TraceCheckUtils]: 44: Hoare triple {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 03:59:58,035 INFO L290 TraceCheckUtils]: 45: Hoare triple {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 03:59:58,040 INFO L272 TraceCheckUtils]: 46: Hoare triple {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,040 INFO L290 TraceCheckUtils]: 47: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,041 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} #68#return; {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 03:59:58,042 INFO L290 TraceCheckUtils]: 51: Hoare triple {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} havoc #t~mem5; {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 03:59:58,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} is VALID [2022-04-08 03:59:58,043 INFO L290 TraceCheckUtils]: 53: Hoare triple {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} is VALID [2022-04-08 03:59:58,045 INFO L272 TraceCheckUtils]: 54: Hoare triple {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,045 INFO L290 TraceCheckUtils]: 55: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,045 INFO L290 TraceCheckUtils]: 56: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,046 INFO L290 TraceCheckUtils]: 57: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-08 03:59:58,046 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} #68#return; {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} is VALID [2022-04-08 03:59:58,047 INFO L290 TraceCheckUtils]: 59: Hoare triple {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} havoc #t~mem5; {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} is VALID [2022-04-08 03:59:58,047 INFO L290 TraceCheckUtils]: 60: Hoare triple {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6247#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 5 main_~i~1))} is VALID [2022-04-08 03:59:58,048 INFO L290 TraceCheckUtils]: 61: Hoare triple {6247#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6045#(= |main_#t~mem5| 0)} is VALID [2022-04-08 03:59:58,048 INFO L272 TraceCheckUtils]: 62: Hoare triple {6045#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:59:58,049 INFO L290 TraceCheckUtils]: 63: Hoare triple {6254#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:59:58,049 INFO L290 TraceCheckUtils]: 64: Hoare triple {6258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6007#false} is VALID [2022-04-08 03:59:58,049 INFO L290 TraceCheckUtils]: 65: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2022-04-08 03:59:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 45 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 03:59:58,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:59:58,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108645321] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:59:58,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 03:59:58,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2022-04-08 03:59:58,507 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:58,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [881726327] [2022-04-08 03:59:58,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [881726327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:58,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:58,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 03:59:58,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400199349] [2022-04-08 03:59:58,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:58,508 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2022-04-08 03:59:58,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:58,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:59:58,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:59:58,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 03:59:58,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:58,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 03:59:58,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 03:59:58,556 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:00:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:00,221 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-04-08 04:00:00,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 04:00:00,222 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2022-04-08 04:00:00,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:00:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:00:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-08 04:00:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:00:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-08 04:00:00,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2022-04-08 04:00:00,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:00:00,289 INFO L225 Difference]: With dead ends: 82 [2022-04-08 04:00:00,289 INFO L226 Difference]: Without dead ends: 80 [2022-04-08 04:00:00,290 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 56 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=295, Invalid=3011, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 04:00:00,290 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 04:00:00,291 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 98 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 04:00:00,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-08 04:00:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-04-08 04:00:00,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:00:00,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:00,317 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:00,317 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:00,318 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-08 04:00:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-08 04:00:00,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:00:00,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:00:00,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 80 states. [2022-04-08 04:00:00,318 INFO L87 Difference]: Start difference. First operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 80 states. [2022-04-08 04:00:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:00,319 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-08 04:00:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-08 04:00:00,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:00:00,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:00:00,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:00:00,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:00:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-04-08 04:00:00,321 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 66 [2022-04-08 04:00:00,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:00:00,321 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-04-08 04:00:00,321 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:00:00,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 78 transitions. [2022-04-08 04:00:00,416 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-08 04:00:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-08 04:00:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 04:00:00,417 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:00:00,417 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:00:00,433 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-08 04:00:00,630 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,SelfDestructingSolverStorable11 [2022-04-08 04:00:00,631 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:00:00,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:00:00,631 INFO L85 PathProgramCache]: Analyzing trace with hash -832116514, now seen corresponding path program 21 times [2022-04-08 04:00:00,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:00:00,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [893042569] [2022-04-08 04:00:00,633 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:00:00,633 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:00:00,633 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:00:00,633 INFO L85 PathProgramCache]: Analyzing trace with hash -832116514, now seen corresponding path program 22 times [2022-04-08 04:00:00,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:00:00,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247751930] [2022-04-08 04:00:00,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:00:00,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:00:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:00,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:00:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:00,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {6848#(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(9, 2); {6804#true} is VALID [2022-04-08 04:00:00,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:00,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-08 04:00:00,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 04:00:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:00,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:00,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:00,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:00,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} #68#return; {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-08 04:00:00,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-08 04:00:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:00,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:00,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:00,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:00,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6822#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:00,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 04:00:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:00,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:00,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:00,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:00,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6827#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:00,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-08 04:00:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:00,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:00,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:00,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:00,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6832#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:00,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-08 04:00:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:00,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:00,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:00,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:00,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6837#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:00,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-08 04:00:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:00,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:00,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:00,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:00,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6842#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:00,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} call ULTIMATE.init(); {6848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:00:00,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {6848#(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(9, 2); {6804#true} is VALID [2022-04-08 04:00:00,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:00,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-08 04:00:00,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-08 04:00:00,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {6804#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6804#true} is VALID [2022-04-08 04:00:00,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {6804#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6809#(= main_~i~0 0)} is VALID [2022-04-08 04:00:00,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {6809#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6809#(= main_~i~0 0)} is VALID [2022-04-08 04:00:00,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {6809#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6810#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:00,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {6810#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6810#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:00,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {6810#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6811#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:00,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {6811#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6811#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:00,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {6811#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6812#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:00,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {6812#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6812#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:00,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {6812#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6813#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:00,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {6813#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6813#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:00,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {6813#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6814#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:00,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6814#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:00,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6815#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:00,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {6815#(<= main_~i~0 6)} assume !(~i~0 < ~n~0); {6816#(<= main_~n~0 6)} is VALID [2022-04-08 04:00:00,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {6816#(<= main_~n~0 6)} ~i~1 := 0; {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-08 04:00:00,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-08 04:00:00,828 INFO L272 TraceCheckUtils]: 22: Hoare triple {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:00,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:00,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:00,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:00,829 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6804#true} {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} #68#return; {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-08 04:00:00,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} havoc #t~mem5; {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-08 04:00:00,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:00,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:00,830 INFO L272 TraceCheckUtils]: 30: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:00,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:00,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:00,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:00,831 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6804#true} {6822#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:00,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:00,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:00,832 INFO L290 TraceCheckUtils]: 37: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:00,832 INFO L272 TraceCheckUtils]: 38: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:00,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:00,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:00,832 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:00,832 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6804#true} {6827#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:00,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:00,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:00,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:00,833 INFO L272 TraceCheckUtils]: 46: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:00,834 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:00,834 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:00,834 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:00,834 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6804#true} {6832#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:00,834 INFO L290 TraceCheckUtils]: 51: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:00,835 INFO L290 TraceCheckUtils]: 52: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:00,835 INFO L290 TraceCheckUtils]: 53: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:00,835 INFO L272 TraceCheckUtils]: 54: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:00,835 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:00,835 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:00,835 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:00,836 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6804#true} {6837#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:00,836 INFO L290 TraceCheckUtils]: 59: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:00,837 INFO L290 TraceCheckUtils]: 60: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:00,837 INFO L290 TraceCheckUtils]: 61: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:00,837 INFO L272 TraceCheckUtils]: 62: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:00,837 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:00,837 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:00,837 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:00,837 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6804#true} {6842#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:00,838 INFO L290 TraceCheckUtils]: 67: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:00,838 INFO L290 TraceCheckUtils]: 68: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6847#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:00:00,838 INFO L290 TraceCheckUtils]: 69: Hoare triple {6847#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6805#false} is VALID [2022-04-08 04:00:00,838 INFO L272 TraceCheckUtils]: 70: Hoare triple {6805#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6805#false} is VALID [2022-04-08 04:00:00,839 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-08 04:00:00,839 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-08 04:00:00,839 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-08 04:00:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 63 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 04:00:00,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:00:00,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247751930] [2022-04-08 04:00:00,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247751930] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:00:00,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056991413] [2022-04-08 04:00:00,839 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:00:00,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:00:00,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:00:00,841 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-08 04:00:00,883 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-08 04:00:00,926 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:00:00,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:00:00,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 04:00:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:00,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:00:01,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} call ULTIMATE.init(); {6804#true} is VALID [2022-04-08 04:00:01,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#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(9, 2); {6804#true} is VALID [2022-04-08 04:00:01,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:01,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-08 04:00:01,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-08 04:00:01,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {6804#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6804#true} is VALID [2022-04-08 04:00:01,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {6804#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6870#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:01,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {6870#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6870#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:01,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {6870#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6810#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:01,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {6810#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6810#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:01,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {6810#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6811#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:01,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {6811#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6811#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:01,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {6811#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6812#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:01,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {6812#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6812#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:01,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {6812#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6813#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:01,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {6813#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6813#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:01,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {6813#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6814#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:01,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6814#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:01,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6815#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:01,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {6815#(<= main_~i~0 6)} assume !(~i~0 < ~n~0); {6816#(<= main_~n~0 6)} is VALID [2022-04-08 04:00:01,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {6816#(<= main_~n~0 6)} ~i~1 := 0; {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-08 04:00:01,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-08 04:00:01,405 INFO L272 TraceCheckUtils]: 22: Hoare triple {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:01,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:01,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:01,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:01,406 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6804#true} {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} #68#return; {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-08 04:00:01,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} havoc #t~mem5; {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-08 04:00:01,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-08 04:00:01,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-08 04:00:01,407 INFO L272 TraceCheckUtils]: 30: Hoare triple {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:01,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:01,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:01,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:01,408 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6804#true} {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} #68#return; {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-08 04:00:01,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} havoc #t~mem5; {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-08 04:00:01,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:01,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:01,409 INFO L272 TraceCheckUtils]: 38: Hoare triple {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:01,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:01,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:01,409 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:01,409 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6804#true} {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} #68#return; {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:01,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} havoc #t~mem5; {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:01,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:01,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:01,411 INFO L272 TraceCheckUtils]: 46: Hoare triple {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:01,411 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:01,411 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:01,411 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:01,411 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6804#true} {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} #68#return; {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:01,411 INFO L290 TraceCheckUtils]: 51: Hoare triple {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} havoc #t~mem5; {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:01,412 INFO L290 TraceCheckUtils]: 52: Hoare triple {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:01,412 INFO L290 TraceCheckUtils]: 53: Hoare triple {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:01,412 INFO L272 TraceCheckUtils]: 54: Hoare triple {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:01,412 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:01,412 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:01,413 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:01,413 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6804#true} {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} #68#return; {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:01,413 INFO L290 TraceCheckUtils]: 59: Hoare triple {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} havoc #t~mem5; {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:01,414 INFO L290 TraceCheckUtils]: 60: Hoare triple {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-08 04:00:01,414 INFO L290 TraceCheckUtils]: 61: Hoare triple {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-08 04:00:01,414 INFO L272 TraceCheckUtils]: 62: Hoare triple {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:01,414 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:01,414 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:01,414 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:01,415 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6804#true} {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} #68#return; {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-08 04:00:01,415 INFO L290 TraceCheckUtils]: 67: Hoare triple {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} havoc #t~mem5; {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-08 04:00:01,415 INFO L290 TraceCheckUtils]: 68: Hoare triple {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7063#(and (<= main_~n~0 6) (<= 6 main_~i~1))} is VALID [2022-04-08 04:00:01,416 INFO L290 TraceCheckUtils]: 69: Hoare triple {7063#(and (<= main_~n~0 6) (<= 6 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6805#false} is VALID [2022-04-08 04:00:01,416 INFO L272 TraceCheckUtils]: 70: Hoare triple {6805#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6805#false} is VALID [2022-04-08 04:00:01,416 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-08 04:00:01,416 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-08 04:00:01,416 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-08 04:00:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 04:00:01,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:00:01,774 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-08 04:00:01,774 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-08 04:00:01,774 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-08 04:00:01,774 INFO L272 TraceCheckUtils]: 70: Hoare triple {6805#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6805#false} is VALID [2022-04-08 04:00:01,775 INFO L290 TraceCheckUtils]: 69: Hoare triple {6847#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6805#false} is VALID [2022-04-08 04:00:01,775 INFO L290 TraceCheckUtils]: 68: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6847#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:00:01,775 INFO L290 TraceCheckUtils]: 67: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:01,776 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6804#true} {6842#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:01,776 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:01,776 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:01,776 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:01,776 INFO L272 TraceCheckUtils]: 62: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:01,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:01,777 INFO L290 TraceCheckUtils]: 60: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:01,777 INFO L290 TraceCheckUtils]: 59: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:01,777 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6804#true} {6837#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:01,778 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:01,778 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:01,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:01,778 INFO L272 TraceCheckUtils]: 54: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:01,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:01,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:01,779 INFO L290 TraceCheckUtils]: 51: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:01,779 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6804#true} {6832#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:01,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:01,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:01,779 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:01,780 INFO L272 TraceCheckUtils]: 46: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:01,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:01,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:01,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:01,781 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6804#true} {6827#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:01,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:01,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:01,781 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:01,781 INFO L272 TraceCheckUtils]: 38: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:01,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:01,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:01,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:01,783 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6804#true} {6822#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:01,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:01,783 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:01,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:01,786 INFO L272 TraceCheckUtils]: 30: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:01,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:01,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {7214#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:01,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {7214#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {7214#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:01,787 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6804#true} {7214#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {7214#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:01,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:01,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-08 04:00:01,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-08 04:00:01,787 INFO L272 TraceCheckUtils]: 22: Hoare triple {7214#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-08 04:00:01,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {7214#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7214#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:01,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {6816#(<= main_~n~0 6)} ~i~1 := 0; {7214#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:01,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {6815#(<= main_~i~0 6)} assume !(~i~0 < ~n~0); {6816#(<= main_~n~0 6)} is VALID [2022-04-08 04:00:01,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6815#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:01,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6814#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:01,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {6813#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6814#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:01,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {6813#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6813#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:01,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {6812#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6813#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:01,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {6812#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6812#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:01,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {6811#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6812#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:01,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {6811#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6811#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:01,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {6810#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6811#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:01,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {6810#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6810#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:01,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {6870#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6810#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:01,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {6870#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6870#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:01,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {6804#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6870#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:01,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {6804#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6804#true} is VALID [2022-04-08 04:00:01,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-08 04:00:01,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-08 04:00:01,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-08 04:00:01,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#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(9, 2); {6804#true} is VALID [2022-04-08 04:00:01,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} call ULTIMATE.init(); {6804#true} is VALID [2022-04-08 04:00:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 04:00:01,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056991413] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:00:01,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 04:00:01,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2022-04-08 04:00:01,794 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:00:01,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [893042569] [2022-04-08 04:00:01,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [893042569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:00:01,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:00:01,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 04:00:01,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800008571] [2022-04-08 04:00:01,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:00:01,795 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 74 [2022-04-08 04:00:01,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:00:01,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:00:01,832 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-08 04:00:01,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 04:00:01,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:00:01,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 04:00:01,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-04-08 04:00:01,833 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:00:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:02,539 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-04-08 04:00:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 04:00:02,539 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 74 [2022-04-08 04:00:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:00:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:00:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-08 04:00:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:00:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-08 04:00:02,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 78 transitions. [2022-04-08 04:00:02,605 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-08 04:00:02,606 INFO L225 Difference]: With dead ends: 116 [2022-04-08 04:00:02,606 INFO L226 Difference]: Without dead ends: 80 [2022-04-08 04:00:02,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=1392, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 04:00:02,607 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:00:02,607 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 62 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 04:00:02,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-08 04:00:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-04-08 04:00:02,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:00:02,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:02,642 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:02,642 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:02,643 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-08 04:00:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-08 04:00:02,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:00:02,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:00:02,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 80 states. [2022-04-08 04:00:02,643 INFO L87 Difference]: Start difference. First operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 80 states. [2022-04-08 04:00:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:02,644 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-08 04:00:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-08 04:00:02,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:00:02,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:00:02,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:00:02,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:00:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-04-08 04:00:02,646 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-04-08 04:00:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:00:02,646 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-04-08 04:00:02,646 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:00:02,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 80 transitions. [2022-04-08 04:00:02,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:00:02,734 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-08 04:00:02,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-08 04:00:02,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:00:02,734 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:00:02,751 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-08 04:00:02,939 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,SelfDestructingSolverStorable12 [2022-04-08 04:00:02,939 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:00:02,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:00:02,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2005759164, now seen corresponding path program 23 times [2022-04-08 04:00:02,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:00:02,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2132287553] [2022-04-08 04:00:02,942 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:00:02,942 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:00:02,942 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:00:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2005759164, now seen corresponding path program 24 times [2022-04-08 04:00:02,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:00:02,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132007923] [2022-04-08 04:00:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:00:02,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:00:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:00:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:03,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {7929#(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(9, 2); {7881#true} is VALID [2022-04-08 04:00:03,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:03,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-08 04:00:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 04:00:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:03,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-08 04:00:03,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-08 04:00:03,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:03,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #68#return; {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-08 04:00:03,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-08 04:00:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:03,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-08 04:00:03,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-08 04:00:03,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:03,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:03,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-08 04:00:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:03,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-08 04:00:03,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-08 04:00:03,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:03,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:03,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 04:00:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:03,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-08 04:00:03,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-08 04:00:03,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:03,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:03,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-08 04:00:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:03,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-08 04:00:03,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-08 04:00:03,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:03,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:03,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-08 04:00:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:03,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-08 04:00:03,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-08 04:00:03,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:03,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:03,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {7881#true} call ULTIMATE.init(); {7929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:00:03,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {7929#(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(9, 2); {7881#true} is VALID [2022-04-08 04:00:03,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:03,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-08 04:00:03,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {7881#true} call #t~ret6 := main(); {7881#true} is VALID [2022-04-08 04:00:03,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {7881#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7881#true} is VALID [2022-04-08 04:00:03,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {7881#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {7886#(= main_~i~0 0)} is VALID [2022-04-08 04:00:03,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {7886#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7886#(= main_~i~0 0)} is VALID [2022-04-08 04:00:03,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {7886#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7887#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:00:03,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {7887#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7887#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:00:03,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {7887#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7888#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:00:03,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {7888#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7888#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:00:03,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {7888#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7889#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:00:03,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {7889#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7889#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:00:03,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {7889#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7890#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:00:03,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {7890#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7890#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:00:03,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {7890#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7891#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:00:03,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {7891#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7891#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:00:03,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {7891#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7892#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:00:03,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {7892#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7893#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:00:03,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {7893#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7894#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} is VALID [2022-04-08 04:00:03,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {7894#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} assume !(~i~0 < ~n~0); {7894#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} is VALID [2022-04-08 04:00:03,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {7894#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} ~i~1 := 0; {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-08 04:00:03,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-08 04:00:03,228 INFO L272 TraceCheckUtils]: 24: Hoare triple {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-08 04:00:03,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-08 04:00:03,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-08 04:00:03,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:03,229 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7881#true} {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #68#return; {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-08 04:00:03,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} havoc #t~mem5; {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-08 04:00:03,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:03,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:03,230 INFO L272 TraceCheckUtils]: 32: Hoare triple {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-08 04:00:03,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-08 04:00:03,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-08 04:00:03,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:03,230 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7881#true} {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:03,231 INFO L290 TraceCheckUtils]: 37: Hoare triple {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:03,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:03,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:03,232 INFO L272 TraceCheckUtils]: 40: Hoare triple {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-08 04:00:03,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-08 04:00:03,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-08 04:00:03,232 INFO L290 TraceCheckUtils]: 43: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:03,232 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7881#true} {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:03,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:03,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:03,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:03,234 INFO L272 TraceCheckUtils]: 48: Hoare triple {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-08 04:00:03,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-08 04:00:03,234 INFO L290 TraceCheckUtils]: 50: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-08 04:00:03,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:03,234 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7881#true} {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:03,235 INFO L290 TraceCheckUtils]: 53: Hoare triple {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:03,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:03,236 INFO L290 TraceCheckUtils]: 55: Hoare triple {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:03,236 INFO L272 TraceCheckUtils]: 56: Hoare triple {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-08 04:00:03,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-08 04:00:03,236 INFO L290 TraceCheckUtils]: 58: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-08 04:00:03,236 INFO L290 TraceCheckUtils]: 59: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:03,236 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7881#true} {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:03,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:03,237 INFO L290 TraceCheckUtils]: 62: Hoare triple {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:03,237 INFO L290 TraceCheckUtils]: 63: Hoare triple {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:03,238 INFO L272 TraceCheckUtils]: 64: Hoare triple {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-08 04:00:03,238 INFO L290 TraceCheckUtils]: 65: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-08 04:00:03,238 INFO L290 TraceCheckUtils]: 66: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-08 04:00:03,238 INFO L290 TraceCheckUtils]: 67: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:03,238 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7881#true} {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:03,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:03,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7925#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:03,239 INFO L290 TraceCheckUtils]: 71: Hoare triple {7925#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7926#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:00:03,240 INFO L272 TraceCheckUtils]: 72: Hoare triple {7926#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7927#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:00:03,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {7927#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7928#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:00:03,240 INFO L290 TraceCheckUtils]: 74: Hoare triple {7928#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7882#false} is VALID [2022-04-08 04:00:03,240 INFO L290 TraceCheckUtils]: 75: Hoare triple {7882#false} assume !false; {7882#false} is VALID [2022-04-08 04:00:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 12 proven. 121 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 04:00:03,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:00:03,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132007923] [2022-04-08 04:00:03,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132007923] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:00:03,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658404478] [2022-04-08 04:00:03,241 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:00:03,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:00:03,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:00:03,242 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-08 04:00:03,245 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-08 04:00:03,330 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 04:00:03,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:00:03,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 04:00:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:03,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:00:03,535 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-08 04:00:08,309 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-08 04:00:08,309 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 23 treesize of output 10 [2022-04-08 04:00:08,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {7881#true} call ULTIMATE.init(); {7881#true} is VALID [2022-04-08 04:00:08,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#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(9, 2); {7881#true} is VALID [2022-04-08 04:00:08,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-08 04:00:08,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-08 04:00:08,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {7881#true} call #t~ret6 := main(); {7881#true} is VALID [2022-04-08 04:00:08,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {7881#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7881#true} is VALID [2022-04-08 04:00:08,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {7881#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {7951#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:08,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {7951#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7951#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:08,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {7951#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7958#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:08,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {7958#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7958#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:08,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {7958#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7965#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:08,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {7965#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7965#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:08,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {7965#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7972#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:08,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {7972#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7972#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:08,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {7972#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7979#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:08,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {7979#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7979#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:08,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {7979#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7986#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:08,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {7986#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7986#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:08,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {7986#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7993#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:08,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {7993#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7997#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 6))} is VALID [2022-04-08 04:00:08,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {7997#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 6))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8001#(exists ((v_main_~i~0_108 Int)) (and (<= main_~i~0 (+ v_main_~i~0_108 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= v_main_~i~0_108 6)))} is VALID [2022-04-08 04:00:08,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {8001#(exists ((v_main_~i~0_108 Int)) (and (<= main_~i~0 (+ v_main_~i~0_108 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= v_main_~i~0_108 6)))} assume !(~i~0 < ~n~0); {8005#(exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6)))} is VALID [2022-04-08 04:00:08,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {8005#(exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6)))} ~i~1 := 0; {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} is VALID [2022-04-08 04:00:08,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} is VALID [2022-04-08 04:00:08,426 INFO L272 TraceCheckUtils]: 24: Hoare triple {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,432 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} #68#return; {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} is VALID [2022-04-08 04:00:08,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} havoc #t~mem5; {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} is VALID [2022-04-08 04:00:08,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-08 04:00:08,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-08 04:00:08,436 INFO L272 TraceCheckUtils]: 32: Hoare triple {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,445 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} #68#return; {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-08 04:00:08,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} havoc #t~mem5; {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-08 04:00:08,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:08,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:08,453 INFO L272 TraceCheckUtils]: 40: Hoare triple {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,480 INFO L290 TraceCheckUtils]: 43: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,481 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} #68#return; {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:08,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} havoc #t~mem5; {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:08,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:08,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:08,485 INFO L272 TraceCheckUtils]: 48: Hoare triple {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,485 INFO L290 TraceCheckUtils]: 49: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,487 INFO L290 TraceCheckUtils]: 51: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,487 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} #68#return; {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:08,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} havoc #t~mem5; {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:08,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:08,489 INFO L290 TraceCheckUtils]: 55: Hoare triple {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:08,491 INFO L272 TraceCheckUtils]: 56: Hoare triple {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,491 INFO L290 TraceCheckUtils]: 57: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,492 INFO L290 TraceCheckUtils]: 58: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,496 INFO L290 TraceCheckUtils]: 59: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,497 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} #68#return; {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:08,497 INFO L290 TraceCheckUtils]: 61: Hoare triple {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} havoc #t~mem5; {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:08,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} is VALID [2022-04-08 04:00:08,498 INFO L290 TraceCheckUtils]: 63: Hoare triple {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} is VALID [2022-04-08 04:00:08,503 INFO L272 TraceCheckUtils]: 64: Hoare triple {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,504 INFO L290 TraceCheckUtils]: 65: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,504 INFO L290 TraceCheckUtils]: 66: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,505 INFO L290 TraceCheckUtils]: 67: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-08 04:00:08,506 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} #68#return; {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} is VALID [2022-04-08 04:00:08,506 INFO L290 TraceCheckUtils]: 69: Hoare triple {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} havoc #t~mem5; {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} is VALID [2022-04-08 04:00:08,507 INFO L290 TraceCheckUtils]: 70: Hoare triple {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8160#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-08 04:00:08,507 INFO L290 TraceCheckUtils]: 71: Hoare triple {8160#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7926#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:00:08,508 INFO L272 TraceCheckUtils]: 72: Hoare triple {7926#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8167#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:00:08,508 INFO L290 TraceCheckUtils]: 73: Hoare triple {8167#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8171#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:00:08,508 INFO L290 TraceCheckUtils]: 74: Hoare triple {8171#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7882#false} is VALID [2022-04-08 04:00:08,509 INFO L290 TraceCheckUtils]: 75: Hoare triple {7882#false} assume !false; {7882#false} is VALID [2022-04-08 04:00:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 66 proven. 67 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 04:00:08,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:00:08,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658404478] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:00:08,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:00:08,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2022-04-08 04:00:08,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:00:08,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2132287553] [2022-04-08 04:00:08,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2132287553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:00:08,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:00:08,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 04:00:08,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55495305] [2022-04-08 04:00:08,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:00:08,801 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 76 [2022-04-08 04:00:08,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:00:08,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:00:08,842 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-08 04:00:08,842 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 04:00:08,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:00:08,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 04:00:08,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1697, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 04:00:08,843 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:00:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:11,047 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2022-04-08 04:00:11,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 04:00:11,048 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 76 [2022-04-08 04:00:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:00:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:00:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-08 04:00:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:00:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-08 04:00:11,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 75 transitions. [2022-04-08 04:00:11,119 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-08 04:00:11,123 INFO L225 Difference]: With dead ends: 92 [2022-04-08 04:00:11,123 INFO L226 Difference]: Without dead ends: 90 [2022-04-08 04:00:11,124 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 64 SyntacticMatches, 12 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=343, Invalid=3689, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 04:00:11,125 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 60 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 04:00:11,125 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 113 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 04:00:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-08 04:00:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2022-04-08 04:00:11,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:00:11,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:00:11,155 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:00:11,155 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:00:11,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:11,156 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-08 04:00:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-08 04:00:11,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:00:11,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:00:11,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 90 states. [2022-04-08 04:00:11,157 INFO L87 Difference]: Start difference. First operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 90 states. [2022-04-08 04:00:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:11,159 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-08 04:00:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-08 04:00:11,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:00:11,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:00:11,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:00:11,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:00:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:00:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-04-08 04:00:11,161 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 76 [2022-04-08 04:00:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:00:11,161 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-04-08 04:00:11,161 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:00:11,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 88 transitions. [2022-04-08 04:00:11,279 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-08 04:00:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-04-08 04:00:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 04:00:11,280 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:00:11,280 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:00:11,297 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-08 04:00:11,480 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,SelfDestructingSolverStorable13 [2022-04-08 04:00:11,480 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:00:11,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:00:11,481 INFO L85 PathProgramCache]: Analyzing trace with hash -209232234, now seen corresponding path program 25 times [2022-04-08 04:00:11,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:00:11,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [27942937] [2022-04-08 04:00:11,484 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:00:11,484 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:00:11,484 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:00:11,484 INFO L85 PathProgramCache]: Analyzing trace with hash -209232234, now seen corresponding path program 26 times [2022-04-08 04:00:11,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:00:11,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217536574] [2022-04-08 04:00:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:00:11,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:00:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:11,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:00:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:11,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {8831#(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(9, 2); {8781#true} is VALID [2022-04-08 04:00:11,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-08 04:00:11,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 04:00:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:11,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:11,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:11,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} #68#return; {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-08 04:00:11,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-08 04:00:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:11,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:11,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:11,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8800#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:11,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-08 04:00:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:11,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:11,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:11,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8805#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:11,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 04:00:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:11,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:11,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:11,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8810#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:11,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-08 04:00:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:11,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:11,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:11,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8815#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:11,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-08 04:00:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:11,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:11,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:11,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8820#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:11,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 04:00:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:11,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:11,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:11,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8825#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:11,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:00:11,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {8831#(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(9, 2); {8781#true} is VALID [2022-04-08 04:00:11,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-08 04:00:11,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-08 04:00:11,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {8781#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8781#true} is VALID [2022-04-08 04:00:11,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {8781#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {8786#(= main_~i~0 0)} is VALID [2022-04-08 04:00:11,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {8786#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8786#(= main_~i~0 0)} is VALID [2022-04-08 04:00:11,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {8786#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8787#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:11,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {8787#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8787#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:11,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {8787#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8788#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:11,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {8788#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8788#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:11,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {8788#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8789#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:11,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {8789#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8789#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:11,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {8789#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8790#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:11,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {8790#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8790#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:11,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {8790#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8791#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:11,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {8791#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8791#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:11,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {8791#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8792#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:11,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {8792#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8792#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:11,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {8792#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8793#(<= main_~i~0 7)} is VALID [2022-04-08 04:00:11,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {8793#(<= main_~i~0 7)} assume !(~i~0 < ~n~0); {8794#(<= main_~n~0 7)} is VALID [2022-04-08 04:00:11,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {8794#(<= main_~n~0 7)} ~i~1 := 0; {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-08 04:00:11,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-08 04:00:11,707 INFO L272 TraceCheckUtils]: 24: Hoare triple {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:11,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:11,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:11,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,708 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8781#true} {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} #68#return; {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-08 04:00:11,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} havoc #t~mem5; {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-08 04:00:11,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:11,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:11,709 INFO L272 TraceCheckUtils]: 32: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:11,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:11,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:11,709 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,710 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8781#true} {8800#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:11,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:11,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:11,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:11,711 INFO L272 TraceCheckUtils]: 40: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:11,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:11,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:11,711 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,712 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8781#true} {8805#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:11,712 INFO L290 TraceCheckUtils]: 45: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:11,712 INFO L290 TraceCheckUtils]: 46: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:11,713 INFO L290 TraceCheckUtils]: 47: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:11,713 INFO L272 TraceCheckUtils]: 48: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:11,713 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:11,713 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:11,713 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,713 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8781#true} {8810#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:11,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:11,714 INFO L290 TraceCheckUtils]: 54: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:11,714 INFO L290 TraceCheckUtils]: 55: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:11,715 INFO L272 TraceCheckUtils]: 56: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:11,715 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:11,715 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:11,715 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,715 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8781#true} {8815#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:11,716 INFO L290 TraceCheckUtils]: 61: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:11,716 INFO L290 TraceCheckUtils]: 62: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:11,716 INFO L290 TraceCheckUtils]: 63: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:11,716 INFO L272 TraceCheckUtils]: 64: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:11,717 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:11,717 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:11,717 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,717 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8781#true} {8820#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:11,717 INFO L290 TraceCheckUtils]: 69: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:11,718 INFO L290 TraceCheckUtils]: 70: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:11,718 INFO L290 TraceCheckUtils]: 71: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:11,718 INFO L272 TraceCheckUtils]: 72: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:11,718 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:11,718 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:11,719 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:11,719 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8781#true} {8825#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:11,719 INFO L290 TraceCheckUtils]: 77: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:11,720 INFO L290 TraceCheckUtils]: 78: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8830#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:00:11,720 INFO L290 TraceCheckUtils]: 79: Hoare triple {8830#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8782#false} is VALID [2022-04-08 04:00:11,720 INFO L272 TraceCheckUtils]: 80: Hoare triple {8782#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8782#false} is VALID [2022-04-08 04:00:11,720 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-08 04:00:11,720 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-08 04:00:11,720 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-08 04:00:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 87 proven. 74 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 04:00:11,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:00:11,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217536574] [2022-04-08 04:00:11,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217536574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:00:11,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349625481] [2022-04-08 04:00:11,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:00:11,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:00:11,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:00:11,722 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-08 04:00:11,722 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-08 04:00:11,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:00:11,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:00:11,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 04:00:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:11,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:00:12,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8781#true} is VALID [2022-04-08 04:00:12,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#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(9, 2); {8781#true} is VALID [2022-04-08 04:00:12,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-08 04:00:12,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-08 04:00:12,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {8781#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8781#true} is VALID [2022-04-08 04:00:12,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {8781#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {8853#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:12,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {8853#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8853#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:12,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {8853#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8787#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:12,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {8787#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8787#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:12,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {8787#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8788#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:12,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {8788#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8788#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:12,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {8788#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8789#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:12,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {8789#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8789#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:12,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {8789#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8790#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:12,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {8790#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8790#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:12,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {8790#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8791#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:12,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {8791#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8791#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:12,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {8791#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8792#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:12,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {8792#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8792#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:12,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {8792#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8793#(<= main_~i~0 7)} is VALID [2022-04-08 04:00:12,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {8793#(<= main_~i~0 7)} assume !(~i~0 < ~n~0); {8794#(<= main_~n~0 7)} is VALID [2022-04-08 04:00:12,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {8794#(<= main_~n~0 7)} ~i~1 := 0; {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,378 INFO L272 TraceCheckUtils]: 24: Hoare triple {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:12,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:12,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:12,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,379 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8781#true} {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} #68#return; {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,380 INFO L272 TraceCheckUtils]: 32: Hoare triple {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:12,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:12,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:12,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,381 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8781#true} {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} #68#return; {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:12,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:12,382 INFO L272 TraceCheckUtils]: 40: Hoare triple {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:12,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:12,382 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:12,383 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,383 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8781#true} {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} #68#return; {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:12,383 INFO L290 TraceCheckUtils]: 45: Hoare triple {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} havoc #t~mem5; {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:12,384 INFO L290 TraceCheckUtils]: 46: Hoare triple {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:12,384 INFO L290 TraceCheckUtils]: 47: Hoare triple {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:12,384 INFO L272 TraceCheckUtils]: 48: Hoare triple {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:12,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:12,384 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:12,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,385 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8781#true} {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} #68#return; {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:12,385 INFO L290 TraceCheckUtils]: 53: Hoare triple {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} havoc #t~mem5; {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:12,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:12,386 INFO L290 TraceCheckUtils]: 55: Hoare triple {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:12,386 INFO L272 TraceCheckUtils]: 56: Hoare triple {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:12,386 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:12,386 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:12,386 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,387 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8781#true} {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} #68#return; {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:12,387 INFO L290 TraceCheckUtils]: 61: Hoare triple {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} havoc #t~mem5; {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:12,387 INFO L290 TraceCheckUtils]: 62: Hoare triple {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,388 INFO L290 TraceCheckUtils]: 63: Hoare triple {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,388 INFO L272 TraceCheckUtils]: 64: Hoare triple {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:12,388 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:12,388 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:12,388 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,388 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8781#true} {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} #68#return; {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,389 INFO L290 TraceCheckUtils]: 69: Hoare triple {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,389 INFO L290 TraceCheckUtils]: 70: Hoare triple {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,390 INFO L290 TraceCheckUtils]: 71: Hoare triple {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,390 INFO L272 TraceCheckUtils]: 72: Hoare triple {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:12,390 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:12,390 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:12,390 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,390 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8781#true} {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} #68#return; {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,391 INFO L290 TraceCheckUtils]: 77: Hoare triple {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,391 INFO L290 TraceCheckUtils]: 78: Hoare triple {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9077#(and (<= 7 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-08 04:00:12,391 INFO L290 TraceCheckUtils]: 79: Hoare triple {9077#(and (<= 7 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8782#false} is VALID [2022-04-08 04:00:12,392 INFO L272 TraceCheckUtils]: 80: Hoare triple {8782#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8782#false} is VALID [2022-04-08 04:00:12,392 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-08 04:00:12,392 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-08 04:00:12,392 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-08 04:00:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 112 proven. 49 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 04:00:12,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:00:12,742 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-08 04:00:12,742 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-08 04:00:12,742 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-08 04:00:12,742 INFO L272 TraceCheckUtils]: 80: Hoare triple {8782#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8782#false} is VALID [2022-04-08 04:00:12,743 INFO L290 TraceCheckUtils]: 79: Hoare triple {8830#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8782#false} is VALID [2022-04-08 04:00:12,743 INFO L290 TraceCheckUtils]: 78: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8830#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:00:12,743 INFO L290 TraceCheckUtils]: 77: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:12,744 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8781#true} {8825#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:12,744 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,744 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:12,744 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:12,744 INFO L272 TraceCheckUtils]: 72: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:12,744 INFO L290 TraceCheckUtils]: 71: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:12,745 INFO L290 TraceCheckUtils]: 70: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:12,745 INFO L290 TraceCheckUtils]: 69: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:12,745 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8781#true} {8820#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:12,745 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,745 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:12,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:12,746 INFO L272 TraceCheckUtils]: 64: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:12,746 INFO L290 TraceCheckUtils]: 63: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:12,746 INFO L290 TraceCheckUtils]: 62: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:12,747 INFO L290 TraceCheckUtils]: 61: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:12,747 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8781#true} {8815#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:12,747 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,747 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:12,747 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:12,747 INFO L272 TraceCheckUtils]: 56: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:12,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:12,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:12,748 INFO L290 TraceCheckUtils]: 53: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:12,749 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8781#true} {8810#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:12,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:12,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:12,749 INFO L272 TraceCheckUtils]: 48: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:12,749 INFO L290 TraceCheckUtils]: 47: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:12,750 INFO L290 TraceCheckUtils]: 46: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:12,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:12,750 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8781#true} {8805#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:12,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,750 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:12,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:12,751 INFO L272 TraceCheckUtils]: 40: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:12,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:12,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:12,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:12,752 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8781#true} {8800#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:12,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:12,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:12,752 INFO L272 TraceCheckUtils]: 32: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:12,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:12,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {9252#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:12,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {9252#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {9252#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:00:12,754 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8781#true} {9252#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {9252#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:00:12,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-08 04:00:12,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-08 04:00:12,754 INFO L272 TraceCheckUtils]: 24: Hoare triple {9252#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-08 04:00:12,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {9252#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9252#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:00:12,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {8794#(<= main_~n~0 7)} ~i~1 := 0; {9252#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:00:12,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {8793#(<= main_~i~0 7)} assume !(~i~0 < ~n~0); {8794#(<= main_~n~0 7)} is VALID [2022-04-08 04:00:12,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {8792#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8793#(<= main_~i~0 7)} is VALID [2022-04-08 04:00:12,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {8792#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8792#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:12,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {8791#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8792#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:12,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {8791#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8791#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:12,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {8790#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8791#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:12,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {8790#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8790#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:12,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {8789#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8790#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:12,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {8789#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8789#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:12,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {8788#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8789#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:12,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {8788#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8788#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:12,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {8787#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8788#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:12,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {8787#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8787#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:12,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {8853#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8787#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:12,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {8853#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8853#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:12,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {8781#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {8853#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:12,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {8781#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8781#true} is VALID [2022-04-08 04:00:12,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-08 04:00:12,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-08 04:00:12,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-08 04:00:12,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#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(9, 2); {8781#true} is VALID [2022-04-08 04:00:12,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8781#true} is VALID [2022-04-08 04:00:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 112 proven. 49 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 04:00:12,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349625481] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:00:12,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 04:00:12,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 30 [2022-04-08 04:00:12,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:00:12,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [27942937] [2022-04-08 04:00:12,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [27942937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:00:12,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:00:12,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 04:00:12,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498409835] [2022-04-08 04:00:12,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:00:12,774 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 84 [2022-04-08 04:00:12,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:00:12,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:12,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:00:12,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 04:00:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:00:12,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 04:00:12,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2022-04-08 04:00:12,821 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:13,538 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-04-08 04:00:13,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 04:00:13,539 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 84 [2022-04-08 04:00:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:00:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-08 04:00:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-08 04:00:13,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 85 transitions. [2022-04-08 04:00:13,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:00:13,608 INFO L225 Difference]: With dead ends: 130 [2022-04-08 04:00:13,608 INFO L226 Difference]: Without dead ends: 90 [2022-04-08 04:00:13,609 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=1756, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 04:00:13,610 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:00:13,611 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 49 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 04:00:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-08 04:00:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-04-08 04:00:13,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:00:13,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:00:13,650 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:00:13,651 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:00:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:13,652 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-08 04:00:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-08 04:00:13,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:00:13,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:00:13,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 90 states. [2022-04-08 04:00:13,652 INFO L87 Difference]: Start difference. First operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 90 states. [2022-04-08 04:00:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:13,654 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-08 04:00:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-08 04:00:13,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:00:13,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:00:13,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:00:13,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:00:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:00:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-04-08 04:00:13,655 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2022-04-08 04:00:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:00:13,655 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-04-08 04:00:13,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:13,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 90 transitions. [2022-04-08 04:00:13,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:00:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-08 04:00:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 04:00:13,775 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:00:13,775 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:00:13,792 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-08 04:00:13,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:00:13,983 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:00:13,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:00:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash 814689524, now seen corresponding path program 27 times [2022-04-08 04:00:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:00:13,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [674645211] [2022-04-08 04:00:13,991 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:00:13,991 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:00:13,991 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:00:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash 814689524, now seen corresponding path program 28 times [2022-04-08 04:00:13,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:00:13,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286147087] [2022-04-08 04:00:13,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:00:13,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:00:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:14,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:00:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:14,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {10051#(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(9, 2); {9997#true} is VALID [2022-04-08 04:00:14,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-08 04:00:14,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 04:00:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:14,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-08 04:00:14,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-08 04:00:14,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:00:14,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-08 04:00:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:14,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-08 04:00:14,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-08 04:00:14,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:00:14,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-08 04:00:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:14,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-08 04:00:14,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-08 04:00:14,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:14,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-08 04:00:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:14,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-08 04:00:14,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-08 04:00:14,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:14,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-08 04:00:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:14,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-08 04:00:14,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-08 04:00:14,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:14,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-08 04:00:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:14,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-08 04:00:14,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-08 04:00:14,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:14,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-08 04:00:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:14,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-08 04:00:14,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-08 04:00:14,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:14,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {9997#true} call ULTIMATE.init(); {10051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:00:14,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {10051#(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(9, 2); {9997#true} is VALID [2022-04-08 04:00:14,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-08 04:00:14,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {9997#true} call #t~ret6 := main(); {9997#true} is VALID [2022-04-08 04:00:14,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {9997#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9997#true} is VALID [2022-04-08 04:00:14,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {9997#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {10002#(= main_~i~0 0)} is VALID [2022-04-08 04:00:14,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {10002#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10002#(= main_~i~0 0)} is VALID [2022-04-08 04:00:14,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {10002#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10003#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:00:14,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {10003#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10003#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:00:14,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {10003#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10004#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:00:14,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {10004#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10004#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:00:14,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {10004#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10005#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:00:14,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {10005#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10005#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:00:14,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {10005#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10006#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:00:14,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {10006#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10006#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:00:14,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {10006#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10007#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:00:14,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {10007#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10007#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:00:14,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {10007#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10008#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:00:14,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {10008#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10008#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:00:14,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {10008#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10009#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:00:14,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {10009#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10010#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} is VALID [2022-04-08 04:00:14,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {10010#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10011#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-08 04:00:14,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {10011#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} assume !(~i~0 < ~n~0); {10011#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-08 04:00:14,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {10011#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} ~i~1 := 0; {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:00:14,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:00:14,343 INFO L272 TraceCheckUtils]: 26: Hoare triple {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-08 04:00:14,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-08 04:00:14,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-08 04:00:14,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,344 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9997#true} {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:00:14,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} havoc #t~mem5; {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:00:14,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:00:14,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:00:14,345 INFO L272 TraceCheckUtils]: 34: Hoare triple {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-08 04:00:14,345 INFO L290 TraceCheckUtils]: 35: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-08 04:00:14,345 INFO L290 TraceCheckUtils]: 36: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-08 04:00:14,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,346 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9997#true} {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:00:14,346 INFO L290 TraceCheckUtils]: 39: Hoare triple {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:00:14,346 INFO L290 TraceCheckUtils]: 40: Hoare triple {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:14,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:14,347 INFO L272 TraceCheckUtils]: 42: Hoare triple {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-08 04:00:14,347 INFO L290 TraceCheckUtils]: 43: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-08 04:00:14,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-08 04:00:14,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,347 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {9997#true} {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:14,348 INFO L290 TraceCheckUtils]: 47: Hoare triple {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:14,348 INFO L290 TraceCheckUtils]: 48: Hoare triple {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:14,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:14,349 INFO L272 TraceCheckUtils]: 50: Hoare triple {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-08 04:00:14,349 INFO L290 TraceCheckUtils]: 51: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-08 04:00:14,349 INFO L290 TraceCheckUtils]: 52: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-08 04:00:14,349 INFO L290 TraceCheckUtils]: 53: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,349 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9997#true} {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:14,350 INFO L290 TraceCheckUtils]: 55: Hoare triple {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:14,350 INFO L290 TraceCheckUtils]: 56: Hoare triple {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:14,351 INFO L290 TraceCheckUtils]: 57: Hoare triple {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:14,351 INFO L272 TraceCheckUtils]: 58: Hoare triple {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-08 04:00:14,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-08 04:00:14,351 INFO L290 TraceCheckUtils]: 60: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-08 04:00:14,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,351 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {9997#true} {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:14,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:14,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:14,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:14,353 INFO L272 TraceCheckUtils]: 66: Hoare triple {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-08 04:00:14,353 INFO L290 TraceCheckUtils]: 67: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-08 04:00:14,353 INFO L290 TraceCheckUtils]: 68: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-08 04:00:14,353 INFO L290 TraceCheckUtils]: 69: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,353 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {9997#true} {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:14,354 INFO L290 TraceCheckUtils]: 71: Hoare triple {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:14,354 INFO L290 TraceCheckUtils]: 72: Hoare triple {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:14,355 INFO L290 TraceCheckUtils]: 73: Hoare triple {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:14,355 INFO L272 TraceCheckUtils]: 74: Hoare triple {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-08 04:00:14,355 INFO L290 TraceCheckUtils]: 75: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-08 04:00:14,355 INFO L290 TraceCheckUtils]: 76: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-08 04:00:14,355 INFO L290 TraceCheckUtils]: 77: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:14,355 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9997#true} {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:14,356 INFO L290 TraceCheckUtils]: 79: Hoare triple {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:14,356 INFO L290 TraceCheckUtils]: 80: Hoare triple {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10047#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:14,356 INFO L290 TraceCheckUtils]: 81: Hoare triple {10047#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10048#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:00:14,357 INFO L272 TraceCheckUtils]: 82: Hoare triple {10048#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10049#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:00:14,357 INFO L290 TraceCheckUtils]: 83: Hoare triple {10049#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10050#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:00:14,357 INFO L290 TraceCheckUtils]: 84: Hoare triple {10050#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9998#false} is VALID [2022-04-08 04:00:14,358 INFO L290 TraceCheckUtils]: 85: Hoare triple {9998#false} assume !false; {9998#false} is VALID [2022-04-08 04:00:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 14 proven. 162 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 04:00:14,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:00:14,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286147087] [2022-04-08 04:00:14,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286147087] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:00:14,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159553219] [2022-04-08 04:00:14,358 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:00:14,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:00:14,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:00:14,359 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-08 04:00:14,360 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-08 04:00:14,463 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:00:14,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:00:14,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 04:00:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:14,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:00:14,718 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-08 04:00:20,630 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-08 04:00:20,631 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 23 treesize of output 10 [2022-04-08 04:00:20,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {9997#true} call ULTIMATE.init(); {9997#true} is VALID [2022-04-08 04:00:20,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#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(9, 2); {9997#true} is VALID [2022-04-08 04:00:20,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-08 04:00:20,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-08 04:00:20,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {9997#true} call #t~ret6 := main(); {9997#true} is VALID [2022-04-08 04:00:20,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {9997#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9997#true} is VALID [2022-04-08 04:00:20,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {9997#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {10073#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:20,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {10073#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10073#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:20,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {10073#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10080#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:20,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {10080#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10080#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:20,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {10080#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10087#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:20,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {10087#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10087#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:20,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {10087#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10094#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:20,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {10094#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10094#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:20,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {10094#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10101#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:20,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {10101#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10101#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:20,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {10101#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10108#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:20,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {10108#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10108#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:20,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {10108#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10115#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:20,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {10115#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10115#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:20,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {10115#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10122#(<= main_~i~0 7)} is VALID [2022-04-08 04:00:20,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {10122#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10126#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-08 04:00:20,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {10126#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10130#(exists ((v_main_~i~0_135 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0) (<= main_~i~0 (+ v_main_~i~0_135 1))))} is VALID [2022-04-08 04:00:20,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {10130#(exists ((v_main_~i~0_135 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0) (<= main_~i~0 (+ v_main_~i~0_135 1))))} assume !(~i~0 < ~n~0); {10134#(exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0)))} is VALID [2022-04-08 04:00:20,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {10134#(exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0)))} ~i~1 := 0; {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,727 INFO L272 TraceCheckUtils]: 26: Hoare triple {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,728 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,730 INFO L290 TraceCheckUtils]: 32: Hoare triple {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,731 INFO L272 TraceCheckUtils]: 34: Hoare triple {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,733 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,735 INFO L290 TraceCheckUtils]: 41: Hoare triple {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,736 INFO L272 TraceCheckUtils]: 42: Hoare triple {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,736 INFO L290 TraceCheckUtils]: 43: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,736 INFO L290 TraceCheckUtils]: 44: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,737 INFO L290 TraceCheckUtils]: 45: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,737 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,740 INFO L272 TraceCheckUtils]: 50: Hoare triple {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,741 INFO L290 TraceCheckUtils]: 52: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,742 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,742 INFO L290 TraceCheckUtils]: 55: Hoare triple {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,744 INFO L290 TraceCheckUtils]: 57: Hoare triple {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,745 INFO L272 TraceCheckUtils]: 58: Hoare triple {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,745 INFO L290 TraceCheckUtils]: 59: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,745 INFO L290 TraceCheckUtils]: 60: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,746 INFO L290 TraceCheckUtils]: 61: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,746 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,747 INFO L290 TraceCheckUtils]: 63: Hoare triple {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,747 INFO L290 TraceCheckUtils]: 64: Hoare triple {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,749 INFO L290 TraceCheckUtils]: 65: Hoare triple {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,750 INFO L272 TraceCheckUtils]: 66: Hoare triple {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,750 INFO L290 TraceCheckUtils]: 67: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,751 INFO L290 TraceCheckUtils]: 68: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,751 INFO L290 TraceCheckUtils]: 69: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,752 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,752 INFO L290 TraceCheckUtils]: 71: Hoare triple {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,753 INFO L290 TraceCheckUtils]: 72: Hoare triple {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,753 INFO L290 TraceCheckUtils]: 73: Hoare triple {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,756 INFO L272 TraceCheckUtils]: 74: Hoare triple {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,756 INFO L290 TraceCheckUtils]: 75: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,757 INFO L290 TraceCheckUtils]: 76: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,757 INFO L290 TraceCheckUtils]: 77: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-08 04:00:20,758 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,758 INFO L290 TraceCheckUtils]: 79: Hoare triple {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,759 INFO L290 TraceCheckUtils]: 80: Hoare triple {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10314#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-08 04:00:20,760 INFO L290 TraceCheckUtils]: 81: Hoare triple {10314#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10048#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:00:20,760 INFO L272 TraceCheckUtils]: 82: Hoare triple {10048#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:00:20,761 INFO L290 TraceCheckUtils]: 83: Hoare triple {10321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:00:20,761 INFO L290 TraceCheckUtils]: 84: Hoare triple {10325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9998#false} is VALID [2022-04-08 04:00:20,761 INFO L290 TraceCheckUtils]: 85: Hoare triple {9998#false} assume !false; {9998#false} is VALID [2022-04-08 04:00:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 91 proven. 85 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 04:00:20,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:00:21,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159553219] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:00:21,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:00:21,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2022-04-08 04:00:21,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:00:21,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [674645211] [2022-04-08 04:00:21,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [674645211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:00:21,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:00:21,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 04:00:21,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444090830] [2022-04-08 04:00:21,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:00:21,286 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 86 [2022-04-08 04:00:21,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:00:21,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:21,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:00:21,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 04:00:21,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:00:21,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 04:00:21,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2028, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 04:00:21,341 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:23,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:23,971 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-04-08 04:00:23,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 04:00:23,987 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 86 [2022-04-08 04:00:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:00:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2022-04-08 04:00:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:23,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2022-04-08 04:00:23,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 82 transitions. [2022-04-08 04:00:24,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:00:24,056 INFO L225 Difference]: With dead ends: 102 [2022-04-08 04:00:24,057 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 04:00:24,058 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 72 SyntacticMatches, 14 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=395, Invalid=4435, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 04:00:24,058 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 65 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:00:24,059 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 128 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 04:00:24,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 04:00:24,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2022-04-08 04:00:24,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:00:24,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:00:24,104 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:00:24,104 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:00:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:24,106 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-08 04:00:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-08 04:00:24,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:00:24,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:00:24,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 100 states. [2022-04-08 04:00:24,106 INFO L87 Difference]: Start difference. First operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 100 states. [2022-04-08 04:00:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:24,108 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-08 04:00:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-08 04:00:24,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:00:24,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:00:24,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:00:24,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:00:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:00:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-04-08 04:00:24,110 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 86 [2022-04-08 04:00:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:00:24,110 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-04-08 04:00:24,111 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:00:24,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 98 transitions. [2022-04-08 04:00:24,255 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-08 04:00:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-08 04:00:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-08 04:00:24,259 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:00:24,259 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:00:24,292 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-08 04:00:24,473 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,SelfDestructingSolverStorable15 [2022-04-08 04:00:24,474 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:00:24,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:00:24,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1169596722, now seen corresponding path program 29 times [2022-04-08 04:00:24,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:00:24,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [997864297] [2022-04-08 04:00:24,476 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:00:24,476 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:00:24,476 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:00:24,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1169596722, now seen corresponding path program 30 times [2022-04-08 04:00:24,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:00:24,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164044295] [2022-04-08 04:00:24,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:00:24,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:00:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:24,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:00:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:24,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {11055#(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(9, 2); {10999#true} is VALID [2022-04-08 04:00:24,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-08 04:00:24,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 04:00:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:24,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} #68#return; {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-08 04:00:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-08 04:00:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:24,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11019#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:00:24,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-08 04:00:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:24,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11024#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:24,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-08 04:00:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:24,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11029#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:24,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-08 04:00:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:24,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11034#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:24,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-08 04:00:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:24,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11039#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:24,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-08 04:00:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:24,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11044#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:24,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 04:00:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:24,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11049#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:24,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {10999#true} call ULTIMATE.init(); {11055#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:00:24,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {11055#(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(9, 2); {10999#true} is VALID [2022-04-08 04:00:24,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-08 04:00:24,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-08 04:00:24,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {10999#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10999#true} is VALID [2022-04-08 04:00:24,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {10999#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {11004#(= main_~i~0 0)} is VALID [2022-04-08 04:00:24,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {11004#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11004#(= main_~i~0 0)} is VALID [2022-04-08 04:00:24,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {11004#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11005#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:24,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {11005#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11005#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:24,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {11005#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11006#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:24,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {11006#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11006#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:24,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {11006#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11007#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:24,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {11007#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11007#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:24,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {11007#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11008#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:24,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {11008#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11008#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:24,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {11008#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11009#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:24,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {11009#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11009#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:24,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {11009#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11010#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:24,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {11010#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11010#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:24,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {11010#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11011#(<= main_~i~0 7)} is VALID [2022-04-08 04:00:24,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {11011#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11011#(<= main_~i~0 7)} is VALID [2022-04-08 04:00:24,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {11011#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11012#(<= main_~i~0 8)} is VALID [2022-04-08 04:00:24,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {11012#(<= main_~i~0 8)} assume !(~i~0 < ~n~0); {11013#(<= main_~n~0 8)} is VALID [2022-04-08 04:00:24,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {11013#(<= main_~n~0 8)} ~i~1 := 0; {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-08 04:00:24,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-08 04:00:24,730 INFO L272 TraceCheckUtils]: 26: Hoare triple {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:24,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,730 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10999#true} {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} #68#return; {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-08 04:00:24,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} havoc #t~mem5; {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-08 04:00:24,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:00:24,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:00:24,731 INFO L272 TraceCheckUtils]: 34: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:24,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,731 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,732 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10999#true} {11019#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:00:24,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:00:24,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:24,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:24,733 INFO L272 TraceCheckUtils]: 42: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:24,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,733 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,734 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10999#true} {11024#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:24,734 INFO L290 TraceCheckUtils]: 47: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:24,734 INFO L290 TraceCheckUtils]: 48: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:24,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:24,735 INFO L272 TraceCheckUtils]: 50: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:24,735 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,735 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,735 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10999#true} {11029#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:24,735 INFO L290 TraceCheckUtils]: 55: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:24,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:24,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:24,736 INFO L272 TraceCheckUtils]: 58: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:24,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,737 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10999#true} {11034#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:24,737 INFO L290 TraceCheckUtils]: 63: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:24,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:24,738 INFO L290 TraceCheckUtils]: 65: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:24,738 INFO L272 TraceCheckUtils]: 66: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:24,738 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,738 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,738 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,738 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10999#true} {11039#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:24,739 INFO L290 TraceCheckUtils]: 71: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:24,739 INFO L290 TraceCheckUtils]: 72: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:24,739 INFO L290 TraceCheckUtils]: 73: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:24,739 INFO L272 TraceCheckUtils]: 74: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:24,739 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,739 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,740 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,740 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10999#true} {11044#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:24,740 INFO L290 TraceCheckUtils]: 79: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:24,741 INFO L290 TraceCheckUtils]: 80: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:24,741 INFO L290 TraceCheckUtils]: 81: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:24,741 INFO L272 TraceCheckUtils]: 82: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:24,741 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:24,741 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:24,741 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:24,741 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10999#true} {11049#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:24,742 INFO L290 TraceCheckUtils]: 87: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:24,742 INFO L290 TraceCheckUtils]: 88: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11054#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:00:24,742 INFO L290 TraceCheckUtils]: 89: Hoare triple {11054#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11000#false} is VALID [2022-04-08 04:00:24,742 INFO L272 TraceCheckUtils]: 90: Hoare triple {11000#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11000#false} is VALID [2022-04-08 04:00:24,743 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-08 04:00:24,743 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-08 04:00:24,743 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-08 04:00:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 115 proven. 93 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 04:00:24,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:00:24,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164044295] [2022-04-08 04:00:24,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164044295] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:00:24,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078844745] [2022-04-08 04:00:24,744 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:00:24,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:00:24,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:00:24,747 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-08 04:00:24,748 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-08 04:00:24,833 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 04:00:24,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:00:24,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 04:00:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:24,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:00:25,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {10999#true} call ULTIMATE.init(); {10999#true} is VALID [2022-04-08 04:00:25,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#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(9, 2); {10999#true} is VALID [2022-04-08 04:00:25,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-08 04:00:25,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-08 04:00:25,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {10999#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10999#true} is VALID [2022-04-08 04:00:25,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {10999#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {11077#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:25,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {11077#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11077#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:25,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {11077#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11005#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:25,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {11005#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11005#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:25,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {11005#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11006#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:25,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {11006#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11006#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:25,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {11006#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11007#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:25,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {11007#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11007#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:25,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {11007#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11008#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:25,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {11008#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11008#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:25,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {11008#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11009#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:25,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {11009#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11009#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:25,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {11009#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11010#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:25,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {11010#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11010#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:25,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {11010#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11011#(<= main_~i~0 7)} is VALID [2022-04-08 04:00:25,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {11011#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11011#(<= main_~i~0 7)} is VALID [2022-04-08 04:00:25,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {11011#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11012#(<= main_~i~0 8)} is VALID [2022-04-08 04:00:25,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {11012#(<= main_~i~0 8)} assume !(~i~0 < ~n~0); {11013#(<= main_~n~0 8)} is VALID [2022-04-08 04:00:25,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {11013#(<= main_~n~0 8)} ~i~1 := 0; {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,480 INFO L272 TraceCheckUtils]: 26: Hoare triple {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,481 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10999#true} {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} #68#return; {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} havoc #t~mem5; {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,482 INFO L272 TraceCheckUtils]: 34: Hoare triple {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,483 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10999#true} {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} #68#return; {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} havoc #t~mem5; {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,483 INFO L290 TraceCheckUtils]: 40: Hoare triple {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:25,486 INFO L290 TraceCheckUtils]: 41: Hoare triple {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:25,486 INFO L272 TraceCheckUtils]: 42: Hoare triple {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,486 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,487 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10999#true} {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} #68#return; {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:25,487 INFO L290 TraceCheckUtils]: 47: Hoare triple {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} havoc #t~mem5; {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} is VALID [2022-04-08 04:00:25,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:25,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:25,488 INFO L272 TraceCheckUtils]: 50: Hoare triple {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,488 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,488 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,489 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10999#true} {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} #68#return; {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:25,494 INFO L290 TraceCheckUtils]: 55: Hoare triple {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} havoc #t~mem5; {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} is VALID [2022-04-08 04:00:25,494 INFO L290 TraceCheckUtils]: 56: Hoare triple {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:25,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:25,495 INFO L272 TraceCheckUtils]: 58: Hoare triple {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,495 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,495 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,495 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,496 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10999#true} {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} #68#return; {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:25,496 INFO L290 TraceCheckUtils]: 63: Hoare triple {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} havoc #t~mem5; {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} is VALID [2022-04-08 04:00:25,497 INFO L290 TraceCheckUtils]: 64: Hoare triple {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} is VALID [2022-04-08 04:00:25,497 INFO L290 TraceCheckUtils]: 65: Hoare triple {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} is VALID [2022-04-08 04:00:25,497 INFO L272 TraceCheckUtils]: 66: Hoare triple {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,497 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,497 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,498 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,498 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10999#true} {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} #68#return; {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} is VALID [2022-04-08 04:00:25,498 INFO L290 TraceCheckUtils]: 71: Hoare triple {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} havoc #t~mem5; {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} is VALID [2022-04-08 04:00:25,499 INFO L290 TraceCheckUtils]: 72: Hoare triple {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,499 INFO L290 TraceCheckUtils]: 73: Hoare triple {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,499 INFO L272 TraceCheckUtils]: 74: Hoare triple {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,499 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,499 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,499 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,500 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10999#true} {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} #68#return; {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,500 INFO L290 TraceCheckUtils]: 79: Hoare triple {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} havoc #t~mem5; {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,500 INFO L290 TraceCheckUtils]: 80: Hoare triple {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,501 INFO L290 TraceCheckUtils]: 81: Hoare triple {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,501 INFO L272 TraceCheckUtils]: 82: Hoare triple {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,501 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,501 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,501 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,502 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10999#true} {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} #68#return; {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,502 INFO L290 TraceCheckUtils]: 87: Hoare triple {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} havoc #t~mem5; {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-08 04:00:25,502 INFO L290 TraceCheckUtils]: 88: Hoare triple {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11332#(and (<= main_~n~0 8) (<= 8 main_~i~1))} is VALID [2022-04-08 04:00:25,503 INFO L290 TraceCheckUtils]: 89: Hoare triple {11332#(and (<= main_~n~0 8) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11000#false} is VALID [2022-04-08 04:00:25,503 INFO L272 TraceCheckUtils]: 90: Hoare triple {11000#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11000#false} is VALID [2022-04-08 04:00:25,503 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-08 04:00:25,503 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-08 04:00:25,503 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-08 04:00:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 144 proven. 64 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 04:00:25,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:00:25,887 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-08 04:00:25,887 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-08 04:00:25,887 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-08 04:00:25,887 INFO L272 TraceCheckUtils]: 90: Hoare triple {11000#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11000#false} is VALID [2022-04-08 04:00:25,888 INFO L290 TraceCheckUtils]: 89: Hoare triple {11054#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11000#false} is VALID [2022-04-08 04:00:25,889 INFO L290 TraceCheckUtils]: 88: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11054#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:00:25,889 INFO L290 TraceCheckUtils]: 87: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:25,890 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10999#true} {11049#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:25,890 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,890 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,890 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,890 INFO L272 TraceCheckUtils]: 82: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,890 INFO L290 TraceCheckUtils]: 81: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:25,891 INFO L290 TraceCheckUtils]: 80: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:00:25,891 INFO L290 TraceCheckUtils]: 79: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:25,891 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10999#true} {11044#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:25,891 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,891 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,892 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,892 INFO L272 TraceCheckUtils]: 74: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,892 INFO L290 TraceCheckUtils]: 73: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:25,892 INFO L290 TraceCheckUtils]: 72: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:00:25,893 INFO L290 TraceCheckUtils]: 71: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:25,893 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10999#true} {11039#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:25,893 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,893 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,893 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,893 INFO L272 TraceCheckUtils]: 66: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,894 INFO L290 TraceCheckUtils]: 65: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:25,894 INFO L290 TraceCheckUtils]: 64: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:00:25,894 INFO L290 TraceCheckUtils]: 63: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:25,895 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10999#true} {11034#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:25,895 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,895 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,895 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,895 INFO L272 TraceCheckUtils]: 58: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,895 INFO L290 TraceCheckUtils]: 57: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:25,896 INFO L290 TraceCheckUtils]: 56: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:00:25,896 INFO L290 TraceCheckUtils]: 55: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:25,896 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10999#true} {11029#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:25,897 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,897 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,897 INFO L272 TraceCheckUtils]: 50: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:25,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:00:25,898 INFO L290 TraceCheckUtils]: 47: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:25,898 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10999#true} {11024#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:25,898 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,899 INFO L272 TraceCheckUtils]: 42: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,899 INFO L290 TraceCheckUtils]: 41: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:25,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:00:25,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:00:25,900 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10999#true} {11019#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:00:25,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,900 INFO L272 TraceCheckUtils]: 34: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:00:25,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {11531#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:00:25,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {11531#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {11531#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:00:25,902 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10999#true} {11531#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {11531#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:00:25,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-08 04:00:25,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-08 04:00:25,902 INFO L272 TraceCheckUtils]: 26: Hoare triple {11531#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-08 04:00:25,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {11531#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11531#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:00:25,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {11013#(<= main_~n~0 8)} ~i~1 := 0; {11531#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:00:25,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {11012#(<= main_~i~0 8)} assume !(~i~0 < ~n~0); {11013#(<= main_~n~0 8)} is VALID [2022-04-08 04:00:25,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {11011#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11012#(<= main_~i~0 8)} is VALID [2022-04-08 04:00:25,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {11011#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11011#(<= main_~i~0 7)} is VALID [2022-04-08 04:00:25,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {11010#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11011#(<= main_~i~0 7)} is VALID [2022-04-08 04:00:25,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {11010#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11010#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:25,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {11009#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11010#(<= main_~i~0 6)} is VALID [2022-04-08 04:00:25,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {11009#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11009#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:25,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {11008#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11009#(<= main_~i~0 5)} is VALID [2022-04-08 04:00:25,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {11008#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11008#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:25,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {11007#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11008#(<= main_~i~0 4)} is VALID [2022-04-08 04:00:25,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {11007#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11007#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:25,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {11006#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11007#(<= main_~i~0 3)} is VALID [2022-04-08 04:00:25,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {11006#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11006#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:25,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {11005#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11006#(<= main_~i~0 2)} is VALID [2022-04-08 04:00:25,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {11005#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11005#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:25,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {11077#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11005#(<= main_~i~0 1)} is VALID [2022-04-08 04:00:25,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {11077#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11077#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:25,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {10999#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {11077#(<= main_~i~0 0)} is VALID [2022-04-08 04:00:25,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {10999#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10999#true} is VALID [2022-04-08 04:00:25,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-08 04:00:25,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-08 04:00:25,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-08 04:00:25,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#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(9, 2); {10999#true} is VALID [2022-04-08 04:00:25,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {10999#true} call ULTIMATE.init(); {10999#true} is VALID [2022-04-08 04:00:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 144 proven. 64 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 04:00:25,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078844745] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:00:25,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 04:00:25,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 33 [2022-04-08 04:00:25,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:00:25,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [997864297] [2022-04-08 04:00:25,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [997864297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:00:25,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:00:25,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 04:00:25,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913020573] [2022-04-08 04:00:25,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:00:25,911 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 94 [2022-04-08 04:00:25,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:00:25,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:00:25,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:00:25,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 04:00:25,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:00:25,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 04:00:25,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 04:00:25,962 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:00:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:26,790 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2022-04-08 04:00:26,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 04:00:26,790 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 94 [2022-04-08 04:00:26,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:00:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:00:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2022-04-08 04:00:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:00:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2022-04-08 04:00:26,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2022-04-08 04:00:26,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:00:26,870 INFO L225 Difference]: With dead ends: 144 [2022-04-08 04:00:26,870 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 04:00:26,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=490, Invalid=2162, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 04:00:26,872 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 48 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 04:00:26,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 61 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 04:00:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 04:00:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-04-08 04:00:26,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:00:26,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:00:26,925 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:00:26,926 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:00:26,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:26,927 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-08 04:00:26,927 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-08 04:00:26,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:00:26,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:00:26,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 100 states. [2022-04-08 04:00:26,928 INFO L87 Difference]: Start difference. First operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 100 states. [2022-04-08 04:00:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:26,929 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-08 04:00:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-08 04:00:26,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:00:26,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:00:26,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:00:26,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:00:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:00:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-04-08 04:00:26,931 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2022-04-08 04:00:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:00:26,931 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-04-08 04:00:26,931 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:00:26,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 100 transitions. [2022-04-08 04:00:27,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:00:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-08 04:00:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-08 04:00:27,070 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:00:27,070 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:00:27,088 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-08 04:00:27,287 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,SelfDestructingSolverStorable16 [2022-04-08 04:00:27,288 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:00:27,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:00:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1315000236, now seen corresponding path program 31 times [2022-04-08 04:00:27,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:00:27,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [317344713] [2022-04-08 04:00:27,290 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:00:27,290 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:00:27,290 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:00:27,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1315000236, now seen corresponding path program 32 times [2022-04-08 04:00:27,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:00:27,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885452331] [2022-04-08 04:00:27,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:00:27,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:00:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:27,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:00:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:27,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {12414#(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(9, 2); {12354#true} is VALID [2022-04-08 04:00:27,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-08 04:00:27,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-08 04:00:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:27,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #68#return; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:00:27,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-08 04:00:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:27,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:00:27,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-08 04:00:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:27,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:00:27,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-08 04:00:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:27,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:27,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 04:00:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:27,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:27,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-08 04:00:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:27,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:27,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-08 04:00:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:27,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:27,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-08 04:00:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:27,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:27,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {12354#true} call ULTIMATE.init(); {12414#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:00:27,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {12414#(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(9, 2); {12354#true} is VALID [2022-04-08 04:00:27,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-08 04:00:27,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-08 04:00:27,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {12354#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12354#true} is VALID [2022-04-08 04:00:27,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {12354#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {12359#(= main_~i~0 0)} is VALID [2022-04-08 04:00:27,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {12359#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12359#(= main_~i~0 0)} is VALID [2022-04-08 04:00:27,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {12359#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:00:27,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:00:27,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:00:27,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:00:27,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:00:27,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:00:27,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:00:27,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:00:27,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:00:27,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:00:27,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:00:27,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:00:27,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:00:27,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:00:27,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:00:27,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12368#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:00:27,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {12368#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-08 04:00:27,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} assume !(~i~0 < ~n~0); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-08 04:00:27,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} ~i~1 := 0; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:00:27,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:00:27,715 INFO L272 TraceCheckUtils]: 28: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:00:27,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,716 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12354#true} {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #68#return; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:00:27,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} havoc #t~mem5; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:00:27,717 INFO L290 TraceCheckUtils]: 34: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:00:27,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:00:27,717 INFO L272 TraceCheckUtils]: 36: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:00:27,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,718 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12354#true} {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:00:27,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:00:27,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:00:27,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:00:27,719 INFO L272 TraceCheckUtils]: 44: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:00:27,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,720 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12354#true} {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:00:27,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:00:27,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:27,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:27,721 INFO L272 TraceCheckUtils]: 52: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:00:27,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,721 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12354#true} {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:27,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:00:27,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:27,722 INFO L290 TraceCheckUtils]: 59: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:27,723 INFO L272 TraceCheckUtils]: 60: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:00:27,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,723 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12354#true} {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:27,723 INFO L290 TraceCheckUtils]: 65: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:27,724 INFO L290 TraceCheckUtils]: 66: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:27,724 INFO L290 TraceCheckUtils]: 67: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:27,724 INFO L272 TraceCheckUtils]: 68: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:00:27,724 INFO L290 TraceCheckUtils]: 69: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,725 INFO L290 TraceCheckUtils]: 70: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,725 INFO L290 TraceCheckUtils]: 71: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,725 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12354#true} {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:27,725 INFO L290 TraceCheckUtils]: 73: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:00:27,726 INFO L290 TraceCheckUtils]: 74: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:27,726 INFO L290 TraceCheckUtils]: 75: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:27,726 INFO L272 TraceCheckUtils]: 76: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:00:27,726 INFO L290 TraceCheckUtils]: 77: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,726 INFO L290 TraceCheckUtils]: 78: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,726 INFO L290 TraceCheckUtils]: 79: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,727 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12354#true} {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:27,727 INFO L290 TraceCheckUtils]: 81: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:00:27,728 INFO L290 TraceCheckUtils]: 82: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:27,728 INFO L290 TraceCheckUtils]: 83: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:27,728 INFO L272 TraceCheckUtils]: 84: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:00:27,728 INFO L290 TraceCheckUtils]: 85: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:00:27,728 INFO L290 TraceCheckUtils]: 86: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:00:27,728 INFO L290 TraceCheckUtils]: 87: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:00:27,729 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12354#true} {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:27,729 INFO L290 TraceCheckUtils]: 89: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:00:27,729 INFO L290 TraceCheckUtils]: 90: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12410#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:00:27,730 INFO L290 TraceCheckUtils]: 91: Hoare triple {12410#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12411#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:00:27,730 INFO L272 TraceCheckUtils]: 92: Hoare triple {12411#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:00:27,730 INFO L290 TraceCheckUtils]: 93: Hoare triple {12412#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12413#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:00:27,731 INFO L290 TraceCheckUtils]: 94: Hoare triple {12413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12355#false} is VALID [2022-04-08 04:00:27,731 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-08 04:00:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 16 proven. 209 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 04:00:27,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:00:27,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885452331] [2022-04-08 04:00:27,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885452331] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:00:27,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522451670] [2022-04-08 04:00:27,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:00:27,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:00:27,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:00:27,733 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-08 04:00:27,734 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-08 04:00:27,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:00:27,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:00:27,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 04:00:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:27,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:00:27,962 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-08 04:02:09,167 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 19 treesize of output 7 [2022-04-08 04:02:09,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {12354#true} call ULTIMATE.init(); {12354#true} is VALID [2022-04-08 04:02:09,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#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(9, 2); {12354#true} is VALID [2022-04-08 04:02:09,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:02:09,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-08 04:02:09,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-08 04:02:09,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {12354#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12354#true} is VALID [2022-04-08 04:02:09,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {12354#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {12359#(= main_~i~0 0)} is VALID [2022-04-08 04:02:09,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {12359#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12359#(= main_~i~0 0)} is VALID [2022-04-08 04:02:09,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {12359#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:02:09,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:02:09,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:02:09,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:02:09,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:02:09,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:02:09,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:02:09,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:02:09,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:02:09,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:02:09,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:02:09,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:02:09,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:02:09,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:02:09,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:02:09,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-08 04:02:09,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-08 04:02:09,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} assume !(~i~0 < ~n~0); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-08 04:02:09,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} ~i~1 := 0; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:02:09,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:02:09,237 INFO L272 TraceCheckUtils]: 28: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,238 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #68#return; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:02:09,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} havoc #t~mem5; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:02:09,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-08 04:02:09,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-08 04:02:09,240 INFO L272 TraceCheckUtils]: 36: Hoare triple {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,242 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} #68#return; {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-08 04:02:09,242 INFO L290 TraceCheckUtils]: 41: Hoare triple {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} havoc #t~mem5; {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-08 04:02:09,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,244 INFO L272 TraceCheckUtils]: 44: Hoare triple {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,244 INFO L290 TraceCheckUtils]: 47: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,245 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,247 INFO L272 TraceCheckUtils]: 52: Hoare triple {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,248 INFO L290 TraceCheckUtils]: 54: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,248 INFO L290 TraceCheckUtils]: 55: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,248 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,249 INFO L290 TraceCheckUtils]: 58: Hoare triple {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,250 INFO L290 TraceCheckUtils]: 59: Hoare triple {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,250 INFO L272 TraceCheckUtils]: 60: Hoare triple {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,251 INFO L290 TraceCheckUtils]: 61: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,251 INFO L290 TraceCheckUtils]: 62: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,251 INFO L290 TraceCheckUtils]: 63: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,252 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,252 INFO L290 TraceCheckUtils]: 65: Hoare triple {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,253 INFO L290 TraceCheckUtils]: 66: Hoare triple {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,253 INFO L290 TraceCheckUtils]: 67: Hoare triple {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,254 INFO L272 TraceCheckUtils]: 68: Hoare triple {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,254 INFO L290 TraceCheckUtils]: 69: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,254 INFO L290 TraceCheckUtils]: 70: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,255 INFO L290 TraceCheckUtils]: 71: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,255 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,256 INFO L290 TraceCheckUtils]: 73: Hoare triple {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,256 INFO L290 TraceCheckUtils]: 74: Hoare triple {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,257 INFO L290 TraceCheckUtils]: 75: Hoare triple {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,257 INFO L272 TraceCheckUtils]: 76: Hoare triple {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,258 INFO L290 TraceCheckUtils]: 77: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,258 INFO L290 TraceCheckUtils]: 78: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,258 INFO L290 TraceCheckUtils]: 79: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,259 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,259 INFO L290 TraceCheckUtils]: 81: Hoare triple {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,260 INFO L290 TraceCheckUtils]: 82: Hoare triple {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,260 INFO L290 TraceCheckUtils]: 83: Hoare triple {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,261 INFO L272 TraceCheckUtils]: 84: Hoare triple {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,261 INFO L290 TraceCheckUtils]: 85: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,262 INFO L290 TraceCheckUtils]: 86: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,262 INFO L290 TraceCheckUtils]: 87: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-08 04:02:09,263 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,263 INFO L290 TraceCheckUtils]: 89: Hoare triple {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,264 INFO L290 TraceCheckUtils]: 90: Hoare triple {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12696#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-08 04:02:09,264 INFO L290 TraceCheckUtils]: 91: Hoare triple {12696#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12411#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:02:09,265 INFO L272 TraceCheckUtils]: 92: Hoare triple {12411#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12703#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:02:09,265 INFO L290 TraceCheckUtils]: 93: Hoare triple {12703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:02:09,265 INFO L290 TraceCheckUtils]: 94: Hoare triple {12707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12355#false} is VALID [2022-04-08 04:02:09,265 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-08 04:02:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 04:02:09,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:02:11,581 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 14 [2022-04-08 04:02:11,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-08 04:02:11,717 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-08 04:02:11,718 INFO L290 TraceCheckUtils]: 94: Hoare triple {12707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12355#false} is VALID [2022-04-08 04:02:11,718 INFO L290 TraceCheckUtils]: 93: Hoare triple {12703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:02:11,719 INFO L272 TraceCheckUtils]: 92: Hoare triple {12411#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12703#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:02:11,719 INFO L290 TraceCheckUtils]: 91: Hoare triple {12410#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12411#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:02:11,720 INFO L290 TraceCheckUtils]: 90: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12410#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:11,720 INFO L290 TraceCheckUtils]: 89: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:11,721 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12354#true} {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:11,721 INFO L290 TraceCheckUtils]: 87: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:02:11,721 INFO L290 TraceCheckUtils]: 86: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:02:11,721 INFO L290 TraceCheckUtils]: 85: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:02:11,721 INFO L272 TraceCheckUtils]: 84: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:02:11,721 INFO L290 TraceCheckUtils]: 83: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:11,722 INFO L290 TraceCheckUtils]: 82: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:11,722 INFO L290 TraceCheckUtils]: 81: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:11,723 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12354#true} {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:11,723 INFO L290 TraceCheckUtils]: 79: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:02:11,723 INFO L290 TraceCheckUtils]: 78: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:02:11,723 INFO L290 TraceCheckUtils]: 77: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:02:11,723 INFO L272 TraceCheckUtils]: 76: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:02:11,724 INFO L290 TraceCheckUtils]: 75: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:11,724 INFO L290 TraceCheckUtils]: 74: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:11,724 INFO L290 TraceCheckUtils]: 73: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:11,725 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12354#true} {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:11,725 INFO L290 TraceCheckUtils]: 71: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:02:11,725 INFO L290 TraceCheckUtils]: 70: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:02:11,725 INFO L290 TraceCheckUtils]: 69: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:02:11,725 INFO L272 TraceCheckUtils]: 68: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:02:11,726 INFO L290 TraceCheckUtils]: 67: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:11,726 INFO L290 TraceCheckUtils]: 66: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:11,727 INFO L290 TraceCheckUtils]: 65: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:11,727 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12354#true} {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:11,727 INFO L290 TraceCheckUtils]: 63: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:02:11,727 INFO L290 TraceCheckUtils]: 62: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:02:11,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:02:11,728 INFO L272 TraceCheckUtils]: 60: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:02:11,728 INFO L290 TraceCheckUtils]: 59: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:11,729 INFO L290 TraceCheckUtils]: 58: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:11,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:11,729 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12354#true} {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:11,730 INFO L290 TraceCheckUtils]: 55: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:02:11,730 INFO L290 TraceCheckUtils]: 54: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:02:11,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:02:11,730 INFO L272 TraceCheckUtils]: 52: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:02:11,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:11,731 INFO L290 TraceCheckUtils]: 50: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:11,731 INFO L290 TraceCheckUtils]: 49: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:11,732 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12354#true} {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:11,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:02:11,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:02:11,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:02:11,732 INFO L272 TraceCheckUtils]: 44: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:02:11,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:11,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:11,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:11,734 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12354#true} {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:11,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:02:11,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:02:11,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:02:11,734 INFO L272 TraceCheckUtils]: 36: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:02:11,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:11,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:11,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:11,736 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12354#true} {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:11,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:02:11,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-08 04:02:11,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-08 04:02:11,736 INFO L272 TraceCheckUtils]: 28: Hoare triple {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-08 04:02:11,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:11,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} ~i~1 := 0; {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:11,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} assume !(~i~0 < ~n~0); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-08 04:02:11,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-08 04:02:11,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-08 04:02:11,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:02:11,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:02:11,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:02:11,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:02:11,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:02:11,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:02:11,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:02:11,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:02:11,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:02:11,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:02:11,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:02:11,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:02:11,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:02:11,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:02:11,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {12359#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:02:11,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {12359#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12359#(= main_~i~0 0)} is VALID [2022-04-08 04:02:11,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {12354#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {12359#(= main_~i~0 0)} is VALID [2022-04-08 04:02:11,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {12354#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12354#true} is VALID [2022-04-08 04:02:11,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-08 04:02:11,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-08 04:02:11,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-08 04:02:11,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#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(9, 2); {12354#true} is VALID [2022-04-08 04:02:11,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {12354#true} call ULTIMATE.init(); {12354#true} is VALID [2022-04-08 04:02:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 16 proven. 209 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 04:02:11,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522451670] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:02:11,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 04:02:11,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 24] total 38 [2022-04-08 04:02:11,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:02:11,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [317344713] [2022-04-08 04:02:11,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [317344713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:02:11,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:02:11,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 04:02:11,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917178005] [2022-04-08 04:02:11,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:02:11,747 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 96 [2022-04-08 04:02:11,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:02:11,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:02:11,795 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-08 04:02:11,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 04:02:11,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:11,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 04:02:11,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1291, Unknown=9, NotChecked=0, Total=1406 [2022-04-08 04:02:11,796 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:02:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:14,720 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2022-04-08 04:02:14,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 04:02:14,721 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 96 [2022-04-08 04:02:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:02:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:02:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 89 transitions. [2022-04-08 04:02:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:02:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 89 transitions. [2022-04-08 04:02:14,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 89 transitions. [2022-04-08 04:02:14,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:14,799 INFO L225 Difference]: With dead ends: 112 [2022-04-08 04:02:14,799 INFO L226 Difference]: Without dead ends: 110 [2022-04-08 04:02:14,800 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 178 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 102.9s TimeCoverageRelationStatistics Valid=244, Invalid=3529, Unknown=9, NotChecked=0, Total=3782 [2022-04-08 04:02:14,800 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 70 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 04:02:14,800 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 131 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 04:02:14,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-08 04:02:14,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2022-04-08 04:02:14,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:02:14,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:14,852 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:14,852 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:14,854 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-08 04:02:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-08 04:02:14,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:14,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:14,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 110 states. [2022-04-08 04:02:14,855 INFO L87 Difference]: Start difference. First operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 110 states. [2022-04-08 04:02:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:14,856 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-08 04:02:14,856 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-08 04:02:14,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:14,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:14,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:02:14,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:02:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-04-08 04:02:14,858 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 96 [2022-04-08 04:02:14,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:02:14,858 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-04-08 04:02:14,859 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:02:14,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 108 transitions. [2022-04-08 04:02:15,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-04-08 04:02:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-08 04:02:15,023 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:02:15,023 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:02:15,040 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-08 04:02:15,224 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 04:02:15,224 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:02:15,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:02:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1911993978, now seen corresponding path program 33 times [2022-04-08 04:02:15,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:15,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1733163102] [2022-04-08 04:02:15,226 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:02:15,226 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:02:15,226 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:02:15,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1911993978, now seen corresponding path program 34 times [2022-04-08 04:02:15,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:02:15,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827060957] [2022-04-08 04:02:15,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:02:15,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:02:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:02:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:15,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {13770#(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(9, 2); {13708#true} is VALID [2022-04-08 04:02:15,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-08 04:02:15,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-08 04:02:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:15,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} #68#return; {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-08 04:02:15,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-08 04:02:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:15,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13729#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:15,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-08 04:02:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:15,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13734#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:15,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-08 04:02:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:15,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13739#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:15,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 04:02:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:15,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13744#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:15,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-08 04:02:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:15,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13749#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:15,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-08 04:02:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:15,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13754#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:15,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-08 04:02:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:15,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13759#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:15,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-08 04:02:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:15,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13764#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:15,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {13708#true} call ULTIMATE.init(); {13770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:02:15,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {13770#(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(9, 2); {13708#true} is VALID [2022-04-08 04:02:15,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-08 04:02:15,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-08 04:02:15,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {13708#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13708#true} is VALID [2022-04-08 04:02:15,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {13708#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {13713#(= main_~i~0 0)} is VALID [2022-04-08 04:02:15,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {13713#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13713#(= main_~i~0 0)} is VALID [2022-04-08 04:02:15,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {13713#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13714#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:15,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {13714#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13714#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:15,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {13714#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13715#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:15,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {13715#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13715#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:15,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {13715#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13716#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:15,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {13716#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13716#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:15,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {13716#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13717#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:15,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {13717#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13717#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:15,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {13717#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13718#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:15,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {13718#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13718#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:15,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {13718#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13719#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:15,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {13719#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13719#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:15,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {13719#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13720#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:15,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {13720#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13720#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:15,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {13720#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13721#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:15,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {13721#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13721#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:15,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {13721#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13722#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:15,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {13722#(<= main_~i~0 9)} assume !(~i~0 < ~n~0); {13723#(<= main_~n~0 9)} is VALID [2022-04-08 04:02:15,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {13723#(<= main_~n~0 9)} ~i~1 := 0; {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-08 04:02:15,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-08 04:02:15,513 INFO L272 TraceCheckUtils]: 28: Hoare triple {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:15,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,513 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13708#true} {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} #68#return; {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-08 04:02:15,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} havoc #t~mem5; {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-08 04:02:15,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:15,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:15,515 INFO L272 TraceCheckUtils]: 36: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:15,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,515 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13708#true} {13729#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:15,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:15,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:15,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:15,516 INFO L272 TraceCheckUtils]: 44: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:15,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,517 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13708#true} {13734#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:15,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:15,518 INFO L290 TraceCheckUtils]: 50: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:15,518 INFO L290 TraceCheckUtils]: 51: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:15,518 INFO L272 TraceCheckUtils]: 52: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:15,518 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,518 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,519 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,519 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13708#true} {13739#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:15,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:15,520 INFO L290 TraceCheckUtils]: 58: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:15,520 INFO L290 TraceCheckUtils]: 59: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:15,520 INFO L272 TraceCheckUtils]: 60: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:15,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,521 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,521 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,521 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13708#true} {13744#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:15,521 INFO L290 TraceCheckUtils]: 65: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:15,522 INFO L290 TraceCheckUtils]: 66: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:15,522 INFO L290 TraceCheckUtils]: 67: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:15,522 INFO L272 TraceCheckUtils]: 68: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:15,522 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,522 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,522 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,523 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13708#true} {13749#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:15,523 INFO L290 TraceCheckUtils]: 73: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:15,524 INFO L290 TraceCheckUtils]: 74: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:15,524 INFO L290 TraceCheckUtils]: 75: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:15,524 INFO L272 TraceCheckUtils]: 76: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:15,524 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,524 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,524 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,525 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13708#true} {13754#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:15,525 INFO L290 TraceCheckUtils]: 81: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:15,526 INFO L290 TraceCheckUtils]: 82: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:15,526 INFO L290 TraceCheckUtils]: 83: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:15,526 INFO L272 TraceCheckUtils]: 84: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:15,526 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,526 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,526 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,527 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13708#true} {13759#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:15,527 INFO L290 TraceCheckUtils]: 89: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:15,528 INFO L290 TraceCheckUtils]: 90: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:15,528 INFO L290 TraceCheckUtils]: 91: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:15,528 INFO L272 TraceCheckUtils]: 92: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:15,528 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:15,528 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:15,528 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:15,529 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13708#true} {13764#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:15,529 INFO L290 TraceCheckUtils]: 97: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:15,529 INFO L290 TraceCheckUtils]: 98: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13769#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:02:15,529 INFO L290 TraceCheckUtils]: 99: Hoare triple {13769#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13709#false} is VALID [2022-04-08 04:02:15,530 INFO L272 TraceCheckUtils]: 100: Hoare triple {13709#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13709#false} is VALID [2022-04-08 04:02:15,530 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-08 04:02:15,530 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-08 04:02:15,530 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-08 04:02:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 147 proven. 114 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 04:02:15,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:02:15,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827060957] [2022-04-08 04:02:15,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827060957] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:02:15,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995848535] [2022-04-08 04:02:15,531 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:02:15,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:15,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:02:15,548 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-08 04:02:15,549 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-08 04:02:15,694 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:02:15,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:02:15,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 04:02:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:15,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:02:16,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {13708#true} call ULTIMATE.init(); {13708#true} is VALID [2022-04-08 04:02:16,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#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(9, 2); {13708#true} is VALID [2022-04-08 04:02:16,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-08 04:02:16,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-08 04:02:16,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {13708#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13708#true} is VALID [2022-04-08 04:02:16,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {13708#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {13792#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:16,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {13792#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13792#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:16,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {13792#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13714#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:16,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {13714#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13714#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:16,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {13714#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13715#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:16,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {13715#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13715#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:16,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {13715#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13716#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:16,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {13716#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13716#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:16,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {13716#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13717#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:16,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {13717#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13717#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:16,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {13717#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13718#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:16,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {13718#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13718#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:16,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {13718#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13719#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:16,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {13719#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13719#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:16,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {13719#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13720#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:16,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {13720#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13720#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:16,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {13720#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13721#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:16,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {13721#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13721#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:16,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {13721#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13722#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:16,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {13722#(<= main_~i~0 9)} assume !(~i~0 < ~n~0); {13723#(<= main_~n~0 9)} is VALID [2022-04-08 04:02:16,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {13723#(<= main_~n~0 9)} ~i~1 := 0; {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} is VALID [2022-04-08 04:02:16,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} is VALID [2022-04-08 04:02:16,498 INFO L272 TraceCheckUtils]: 28: Hoare triple {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,499 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13708#true} {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} #68#return; {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} is VALID [2022-04-08 04:02:16,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} havoc #t~mem5; {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} is VALID [2022-04-08 04:02:16,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-08 04:02:16,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-08 04:02:16,500 INFO L272 TraceCheckUtils]: 36: Hoare triple {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,501 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13708#true} {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} #68#return; {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-08 04:02:16,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} havoc #t~mem5; {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-08 04:02:16,502 INFO L290 TraceCheckUtils]: 42: Hoare triple {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} is VALID [2022-04-08 04:02:16,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} is VALID [2022-04-08 04:02:16,502 INFO L272 TraceCheckUtils]: 44: Hoare triple {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,502 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,503 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13708#true} {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} #68#return; {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} is VALID [2022-04-08 04:02:16,503 INFO L290 TraceCheckUtils]: 49: Hoare triple {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} havoc #t~mem5; {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} is VALID [2022-04-08 04:02:16,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} is VALID [2022-04-08 04:02:16,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} is VALID [2022-04-08 04:02:16,504 INFO L272 TraceCheckUtils]: 52: Hoare triple {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,505 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13708#true} {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} #68#return; {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} is VALID [2022-04-08 04:02:16,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} havoc #t~mem5; {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} is VALID [2022-04-08 04:02:16,506 INFO L290 TraceCheckUtils]: 58: Hoare triple {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} is VALID [2022-04-08 04:02:16,506 INFO L290 TraceCheckUtils]: 59: Hoare triple {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} is VALID [2022-04-08 04:02:16,506 INFO L272 TraceCheckUtils]: 60: Hoare triple {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,506 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,506 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,506 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,507 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13708#true} {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} #68#return; {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} is VALID [2022-04-08 04:02:16,507 INFO L290 TraceCheckUtils]: 65: Hoare triple {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} havoc #t~mem5; {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} is VALID [2022-04-08 04:02:16,508 INFO L290 TraceCheckUtils]: 66: Hoare triple {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} is VALID [2022-04-08 04:02:16,508 INFO L290 TraceCheckUtils]: 67: Hoare triple {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} is VALID [2022-04-08 04:02:16,508 INFO L272 TraceCheckUtils]: 68: Hoare triple {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,508 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,508 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,508 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,509 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13708#true} {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} #68#return; {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} is VALID [2022-04-08 04:02:16,509 INFO L290 TraceCheckUtils]: 73: Hoare triple {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} havoc #t~mem5; {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} is VALID [2022-04-08 04:02:16,510 INFO L290 TraceCheckUtils]: 74: Hoare triple {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-08 04:02:16,510 INFO L290 TraceCheckUtils]: 75: Hoare triple {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-08 04:02:16,510 INFO L272 TraceCheckUtils]: 76: Hoare triple {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,510 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,510 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,510 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,511 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13708#true} {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} #68#return; {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-08 04:02:16,511 INFO L290 TraceCheckUtils]: 81: Hoare triple {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} havoc #t~mem5; {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-08 04:02:16,511 INFO L290 TraceCheckUtils]: 82: Hoare triple {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} is VALID [2022-04-08 04:02:16,512 INFO L290 TraceCheckUtils]: 83: Hoare triple {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} is VALID [2022-04-08 04:02:16,512 INFO L272 TraceCheckUtils]: 84: Hoare triple {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,512 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,512 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,512 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,513 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13708#true} {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} #68#return; {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} is VALID [2022-04-08 04:02:16,513 INFO L290 TraceCheckUtils]: 89: Hoare triple {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} havoc #t~mem5; {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} is VALID [2022-04-08 04:02:16,513 INFO L290 TraceCheckUtils]: 90: Hoare triple {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} is VALID [2022-04-08 04:02:16,514 INFO L290 TraceCheckUtils]: 91: Hoare triple {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} is VALID [2022-04-08 04:02:16,514 INFO L272 TraceCheckUtils]: 92: Hoare triple {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,514 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,514 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,514 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,514 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13708#true} {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} #68#return; {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} is VALID [2022-04-08 04:02:16,515 INFO L290 TraceCheckUtils]: 97: Hoare triple {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} havoc #t~mem5; {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} is VALID [2022-04-08 04:02:16,515 INFO L290 TraceCheckUtils]: 98: Hoare triple {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14078#(and (<= main_~n~0 9) (<= 9 main_~i~1))} is VALID [2022-04-08 04:02:16,516 INFO L290 TraceCheckUtils]: 99: Hoare triple {14078#(and (<= main_~n~0 9) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13709#false} is VALID [2022-04-08 04:02:16,516 INFO L272 TraceCheckUtils]: 100: Hoare triple {13709#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13709#false} is VALID [2022-04-08 04:02:16,516 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-08 04:02:16,516 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-08 04:02:16,516 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-08 04:02:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 180 proven. 81 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 04:02:16,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:02:16,952 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-08 04:02:16,953 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-08 04:02:16,953 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-08 04:02:16,953 INFO L272 TraceCheckUtils]: 100: Hoare triple {13709#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13709#false} is VALID [2022-04-08 04:02:16,953 INFO L290 TraceCheckUtils]: 99: Hoare triple {13769#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13709#false} is VALID [2022-04-08 04:02:16,954 INFO L290 TraceCheckUtils]: 98: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13769#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:02:16,954 INFO L290 TraceCheckUtils]: 97: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:16,954 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13708#true} {13764#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:16,954 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,955 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,955 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,955 INFO L272 TraceCheckUtils]: 92: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,955 INFO L290 TraceCheckUtils]: 91: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:16,955 INFO L290 TraceCheckUtils]: 90: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:16,956 INFO L290 TraceCheckUtils]: 89: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:16,956 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13708#true} {13759#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:16,956 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,956 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,956 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,956 INFO L272 TraceCheckUtils]: 84: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,964 INFO L290 TraceCheckUtils]: 83: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:16,965 INFO L290 TraceCheckUtils]: 82: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:16,965 INFO L290 TraceCheckUtils]: 81: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:16,966 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13708#true} {13754#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:16,966 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,966 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,966 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,966 INFO L272 TraceCheckUtils]: 76: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,966 INFO L290 TraceCheckUtils]: 75: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:16,967 INFO L290 TraceCheckUtils]: 74: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:16,967 INFO L290 TraceCheckUtils]: 73: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:16,967 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13708#true} {13749#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:16,967 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,968 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,968 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,968 INFO L272 TraceCheckUtils]: 68: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,968 INFO L290 TraceCheckUtils]: 67: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:16,968 INFO L290 TraceCheckUtils]: 66: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:16,969 INFO L290 TraceCheckUtils]: 65: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:16,969 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13708#true} {13744#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:16,969 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,969 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,969 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,969 INFO L272 TraceCheckUtils]: 60: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,970 INFO L290 TraceCheckUtils]: 59: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:16,970 INFO L290 TraceCheckUtils]: 58: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:16,970 INFO L290 TraceCheckUtils]: 57: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:16,971 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13708#true} {13739#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:16,971 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,971 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,971 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,971 INFO L272 TraceCheckUtils]: 52: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:16,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:16,976 INFO L290 TraceCheckUtils]: 49: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:16,976 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13708#true} {13734#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:16,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,976 INFO L272 TraceCheckUtils]: 44: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:16,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:16,978 INFO L290 TraceCheckUtils]: 41: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:16,978 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13708#true} {13729#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:16,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,978 INFO L272 TraceCheckUtils]: 36: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,979 INFO L290 TraceCheckUtils]: 35: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:16,979 INFO L290 TraceCheckUtils]: 34: Hoare triple {14301#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:16,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {14301#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {14301#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:16,980 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13708#true} {14301#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {14301#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:16,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-08 04:02:16,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-08 04:02:16,980 INFO L272 TraceCheckUtils]: 28: Hoare triple {14301#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-08 04:02:16,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {14301#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14301#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:16,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {13723#(<= main_~n~0 9)} ~i~1 := 0; {14301#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:16,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {13722#(<= main_~i~0 9)} assume !(~i~0 < ~n~0); {13723#(<= main_~n~0 9)} is VALID [2022-04-08 04:02:16,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {13721#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13722#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:16,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {13721#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13721#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:16,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {13720#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13721#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:16,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {13720#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13720#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:16,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {13719#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13720#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:16,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {13719#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13719#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:16,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {13718#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13719#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:16,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {13718#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13718#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:16,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {13717#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13718#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:16,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {13717#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13717#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:16,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {13716#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13717#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:16,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {13716#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13716#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:16,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {13715#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13716#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:16,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {13715#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13715#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:16,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {13714#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13715#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:16,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {13714#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13714#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:16,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {13792#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13714#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:16,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {13792#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13792#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:16,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {13708#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {13792#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:16,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {13708#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13708#true} is VALID [2022-04-08 04:02:16,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-08 04:02:16,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-08 04:02:16,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-08 04:02:16,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#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(9, 2); {13708#true} is VALID [2022-04-08 04:02:16,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {13708#true} call ULTIMATE.init(); {13708#true} is VALID [2022-04-08 04:02:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 180 proven. 81 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 04:02:16,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995848535] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:02:16,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 04:02:16,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 36 [2022-04-08 04:02:16,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:02:16,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1733163102] [2022-04-08 04:02:16,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1733163102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:02:16,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:02:16,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 04:02:16,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771473093] [2022-04-08 04:02:16,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:02:16,989 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 104 [2022-04-08 04:02:16,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:02:16,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:02:17,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:17,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 04:02:17,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:17,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 04:02:17,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 04:02:17,042 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:02:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:18,161 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-04-08 04:02:18,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 04:02:18,161 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 104 [2022-04-08 04:02:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:02:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:02:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 99 transitions. [2022-04-08 04:02:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:02:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 99 transitions. [2022-04-08 04:02:18,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 99 transitions. [2022-04-08 04:02:18,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:18,254 INFO L225 Difference]: With dead ends: 158 [2022-04-08 04:02:18,254 INFO L226 Difference]: Without dead ends: 110 [2022-04-08 04:02:18,256 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=582, Invalid=2610, Unknown=0, NotChecked=0, Total=3192 [2022-04-08 04:02:18,256 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:02:18,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 78 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 04:02:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-08 04:02:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-04-08 04:02:18,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:02:18,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:18,310 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:18,310 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:18,312 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-08 04:02:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-08 04:02:18,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:18,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:18,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 110 states. [2022-04-08 04:02:18,312 INFO L87 Difference]: Start difference. First operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 110 states. [2022-04-08 04:02:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:18,314 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-08 04:02:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-08 04:02:18,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:18,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:18,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:02:18,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:02:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2022-04-08 04:02:18,316 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2022-04-08 04:02:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:02:18,317 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2022-04-08 04:02:18,317 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:02:18,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 110 transitions. [2022-04-08 04:02:18,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-08 04:02:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-08 04:02:18,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:02:18,464 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:02:18,480 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-08 04:02:18,674 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:18,674 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:02:18,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:02:18,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1220002588, now seen corresponding path program 35 times [2022-04-08 04:02:18,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:18,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2111933475] [2022-04-08 04:02:18,677 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:02:18,677 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:02:18,677 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:02:18,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1220002588, now seen corresponding path program 36 times [2022-04-08 04:02:18,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:02:18,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539308139] [2022-04-08 04:02:18,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:02:18,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:02:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:19,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:02:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:19,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {15268#(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(9, 2); {15202#true} is VALID [2022-04-08 04:02:19,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-08 04:02:19,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-08 04:02:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:19,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} #68#return; {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:02:19,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 04:02:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:19,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:19,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-08 04:02:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:19,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:19,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-08 04:02:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:19,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:19,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-08 04:02:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:19,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:19,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-08 04:02:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:19,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:19,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-08 04:02:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:19,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:19,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-08 04:02:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:19,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:19,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-08 04:02:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:19,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:19,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {15202#true} call ULTIMATE.init(); {15268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:02:19,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {15268#(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(9, 2); {15202#true} is VALID [2022-04-08 04:02:19,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-08 04:02:19,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {15202#true} call #t~ret6 := main(); {15202#true} is VALID [2022-04-08 04:02:19,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {15202#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15202#true} is VALID [2022-04-08 04:02:19,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {15202#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {15207#(= main_~i~0 0)} is VALID [2022-04-08 04:02:19,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {15207#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15207#(= main_~i~0 0)} is VALID [2022-04-08 04:02:19,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {15207#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15208#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:02:19,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {15208#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15208#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:02:19,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {15208#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15209#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:02:19,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {15209#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15209#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:02:19,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {15209#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15210#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:02:19,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {15210#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15210#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:02:19,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {15210#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15211#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:02:19,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {15211#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15211#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:02:19,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {15211#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15212#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:02:19,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {15212#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15212#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:02:19,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {15212#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15213#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:02:19,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {15213#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15213#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:02:19,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {15213#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15214#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:02:19,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {15214#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15214#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:02:19,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {15214#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15215#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:02:19,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {15215#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15215#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:02:19,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {15215#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15216#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:02:19,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {15216#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15217#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:02:19,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {15217#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15218#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0)} is VALID [2022-04-08 04:02:19,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {15218#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0)} assume !(~i~0 < ~n~0); {15218#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0)} is VALID [2022-04-08 04:02:19,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {15218#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0)} ~i~1 := 0; {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:02:19,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:02:19,129 INFO L272 TraceCheckUtils]: 30: Hoare triple {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-08 04:02:19,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,129 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15202#true} {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} #68#return; {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:02:19,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} havoc #t~mem5; {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:02:19,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:19,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:19,131 INFO L272 TraceCheckUtils]: 38: Hoare triple {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-08 04:02:19,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,131 INFO L290 TraceCheckUtils]: 41: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,131 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15202#true} {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:19,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:19,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:19,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:19,133 INFO L272 TraceCheckUtils]: 46: Hoare triple {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-08 04:02:19,133 INFO L290 TraceCheckUtils]: 47: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,133 INFO L290 TraceCheckUtils]: 48: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,134 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15202#true} {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:19,134 INFO L290 TraceCheckUtils]: 51: Hoare triple {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:19,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:19,135 INFO L290 TraceCheckUtils]: 53: Hoare triple {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:19,135 INFO L272 TraceCheckUtils]: 54: Hoare triple {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-08 04:02:19,135 INFO L290 TraceCheckUtils]: 55: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,135 INFO L290 TraceCheckUtils]: 56: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,135 INFO L290 TraceCheckUtils]: 57: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,135 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15202#true} {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:19,136 INFO L290 TraceCheckUtils]: 59: Hoare triple {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:19,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:19,137 INFO L290 TraceCheckUtils]: 61: Hoare triple {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:19,137 INFO L272 TraceCheckUtils]: 62: Hoare triple {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-08 04:02:19,137 INFO L290 TraceCheckUtils]: 63: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,137 INFO L290 TraceCheckUtils]: 64: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,137 INFO L290 TraceCheckUtils]: 65: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,137 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15202#true} {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:19,138 INFO L290 TraceCheckUtils]: 67: Hoare triple {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:19,138 INFO L290 TraceCheckUtils]: 68: Hoare triple {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:19,139 INFO L290 TraceCheckUtils]: 69: Hoare triple {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:19,139 INFO L272 TraceCheckUtils]: 70: Hoare triple {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-08 04:02:19,139 INFO L290 TraceCheckUtils]: 71: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,139 INFO L290 TraceCheckUtils]: 72: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,139 INFO L290 TraceCheckUtils]: 73: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,140 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15202#true} {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:19,140 INFO L290 TraceCheckUtils]: 75: Hoare triple {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:19,140 INFO L290 TraceCheckUtils]: 76: Hoare triple {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:19,141 INFO L290 TraceCheckUtils]: 77: Hoare triple {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:19,141 INFO L272 TraceCheckUtils]: 78: Hoare triple {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-08 04:02:19,141 INFO L290 TraceCheckUtils]: 79: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,141 INFO L290 TraceCheckUtils]: 80: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,141 INFO L290 TraceCheckUtils]: 81: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,142 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15202#true} {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:19,142 INFO L290 TraceCheckUtils]: 83: Hoare triple {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:19,142 INFO L290 TraceCheckUtils]: 84: Hoare triple {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:19,143 INFO L290 TraceCheckUtils]: 85: Hoare triple {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:19,143 INFO L272 TraceCheckUtils]: 86: Hoare triple {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-08 04:02:19,143 INFO L290 TraceCheckUtils]: 87: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,143 INFO L290 TraceCheckUtils]: 88: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,143 INFO L290 TraceCheckUtils]: 89: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,144 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15202#true} {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:19,144 INFO L290 TraceCheckUtils]: 91: Hoare triple {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:19,145 INFO L290 TraceCheckUtils]: 92: Hoare triple {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:19,145 INFO L290 TraceCheckUtils]: 93: Hoare triple {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:19,145 INFO L272 TraceCheckUtils]: 94: Hoare triple {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-08 04:02:19,145 INFO L290 TraceCheckUtils]: 95: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-08 04:02:19,145 INFO L290 TraceCheckUtils]: 96: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-08 04:02:19,145 INFO L290 TraceCheckUtils]: 97: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:19,146 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15202#true} {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:19,146 INFO L290 TraceCheckUtils]: 99: Hoare triple {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:19,146 INFO L290 TraceCheckUtils]: 100: Hoare triple {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15264#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:19,147 INFO L290 TraceCheckUtils]: 101: Hoare triple {15264#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15265#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:02:19,147 INFO L272 TraceCheckUtils]: 102: Hoare triple {15265#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:02:19,148 INFO L290 TraceCheckUtils]: 103: Hoare triple {15266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:02:19,148 INFO L290 TraceCheckUtils]: 104: Hoare triple {15267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15203#false} is VALID [2022-04-08 04:02:19,148 INFO L290 TraceCheckUtils]: 105: Hoare triple {15203#false} assume !false; {15203#false} is VALID [2022-04-08 04:02:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 18 proven. 262 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 04:02:19,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:02:19,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539308139] [2022-04-08 04:02:19,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539308139] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:02:19,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226039066] [2022-04-08 04:02:19,149 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:02:19,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:19,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:02:19,150 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-08 04:02:19,175 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-08 04:02:19,335 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-08 04:02:19,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:02:19,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 04:02:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:19,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:02:19,684 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-08 04:02:28,469 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-08 04:02:28,469 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 23 treesize of output 10 [2022-04-08 04:02:28,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {15202#true} call ULTIMATE.init(); {15202#true} is VALID [2022-04-08 04:02:28,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#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(9, 2); {15202#true} is VALID [2022-04-08 04:02:28,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-08 04:02:28,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-08 04:02:28,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {15202#true} call #t~ret6 := main(); {15202#true} is VALID [2022-04-08 04:02:28,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {15202#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15202#true} is VALID [2022-04-08 04:02:28,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {15202#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {15290#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:28,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {15290#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15290#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:28,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {15290#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15297#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:28,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {15297#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15297#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:28,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {15297#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15304#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:28,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {15304#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15304#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:28,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {15304#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15311#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:28,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {15311#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15311#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:28,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {15311#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15318#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:28,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {15318#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15318#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:28,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {15318#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15325#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:28,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {15325#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15325#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:28,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {15325#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15332#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:28,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {15332#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15332#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:28,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {15332#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15339#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:28,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {15339#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15339#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:28,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {15339#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15346#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:28,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {15346#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15346#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:28,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {15346#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15353#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:28,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {15353#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15357#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 9))} is VALID [2022-04-08 04:02:28,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {15357#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15361#(exists ((v_main_~i~0_207 Int)) (and (<= main_~i~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {15361#(exists ((v_main_~i~0_207 Int)) (and (<= main_~i~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9)))} assume !(~i~0 < ~n~0); {15365#(exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {15365#(exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9)))} ~i~1 := 0; {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,626 INFO L272 TraceCheckUtils]: 30: Hoare triple {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,632 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,640 INFO L272 TraceCheckUtils]: 38: Hoare triple {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,644 INFO L290 TraceCheckUtils]: 40: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,645 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,646 INFO L290 TraceCheckUtils]: 43: Hoare triple {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,647 INFO L290 TraceCheckUtils]: 44: Hoare triple {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,651 INFO L272 TraceCheckUtils]: 46: Hoare triple {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,652 INFO L290 TraceCheckUtils]: 47: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,653 INFO L290 TraceCheckUtils]: 49: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,654 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,655 INFO L290 TraceCheckUtils]: 51: Hoare triple {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,661 INFO L272 TraceCheckUtils]: 54: Hoare triple {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,711 INFO L290 TraceCheckUtils]: 55: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,712 INFO L290 TraceCheckUtils]: 56: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,714 INFO L290 TraceCheckUtils]: 57: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,715 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,715 INFO L290 TraceCheckUtils]: 59: Hoare triple {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,716 INFO L290 TraceCheckUtils]: 60: Hoare triple {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,717 INFO L290 TraceCheckUtils]: 61: Hoare triple {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,720 INFO L272 TraceCheckUtils]: 62: Hoare triple {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,721 INFO L290 TraceCheckUtils]: 64: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,722 INFO L290 TraceCheckUtils]: 65: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,722 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,723 INFO L290 TraceCheckUtils]: 67: Hoare triple {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,724 INFO L290 TraceCheckUtils]: 68: Hoare triple {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,724 INFO L290 TraceCheckUtils]: 69: Hoare triple {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,727 INFO L272 TraceCheckUtils]: 70: Hoare triple {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,730 INFO L290 TraceCheckUtils]: 71: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,731 INFO L290 TraceCheckUtils]: 72: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,732 INFO L290 TraceCheckUtils]: 73: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,732 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,733 INFO L290 TraceCheckUtils]: 75: Hoare triple {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,734 INFO L290 TraceCheckUtils]: 76: Hoare triple {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,734 INFO L290 TraceCheckUtils]: 77: Hoare triple {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,738 INFO L272 TraceCheckUtils]: 78: Hoare triple {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,740 INFO L290 TraceCheckUtils]: 79: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,745 INFO L290 TraceCheckUtils]: 80: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,746 INFO L290 TraceCheckUtils]: 81: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,746 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,747 INFO L290 TraceCheckUtils]: 83: Hoare triple {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,748 INFO L290 TraceCheckUtils]: 84: Hoare triple {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,749 INFO L290 TraceCheckUtils]: 85: Hoare triple {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,751 INFO L272 TraceCheckUtils]: 86: Hoare triple {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,752 INFO L290 TraceCheckUtils]: 87: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,755 INFO L290 TraceCheckUtils]: 88: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,756 INFO L290 TraceCheckUtils]: 89: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,756 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,757 INFO L290 TraceCheckUtils]: 91: Hoare triple {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,758 INFO L290 TraceCheckUtils]: 92: Hoare triple {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,758 INFO L290 TraceCheckUtils]: 93: Hoare triple {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,762 INFO L272 TraceCheckUtils]: 94: Hoare triple {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,762 INFO L290 TraceCheckUtils]: 95: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,767 INFO L290 TraceCheckUtils]: 96: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,768 INFO L290 TraceCheckUtils]: 97: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-08 04:02:28,769 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,770 INFO L290 TraceCheckUtils]: 99: Hoare triple {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,770 INFO L290 TraceCheckUtils]: 100: Hoare triple {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15595#(and (<= 9 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-08 04:02:28,771 INFO L290 TraceCheckUtils]: 101: Hoare triple {15595#(and (<= 9 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15265#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:02:28,771 INFO L272 TraceCheckUtils]: 102: Hoare triple {15265#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:02:28,772 INFO L290 TraceCheckUtils]: 103: Hoare triple {15602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:02:28,772 INFO L290 TraceCheckUtils]: 104: Hoare triple {15606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15203#false} is VALID [2022-04-08 04:02:28,772 INFO L290 TraceCheckUtils]: 105: Hoare triple {15203#false} assume !false; {15203#false} is VALID [2022-04-08 04:02:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 153 proven. 127 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 04:02:28,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:02:29,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226039066] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:02:29,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:02:29,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 54 [2022-04-08 04:02:29,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:02:29,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2111933475] [2022-04-08 04:02:29,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2111933475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:02:29,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:02:29,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 04:02:29,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898339914] [2022-04-08 04:02:29,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:02:29,070 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 106 [2022-04-08 04:02:29,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:02:29,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:02:29,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:29,123 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 04:02:29,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:29,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 04:02:29,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2777, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 04:02:29,124 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:02:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:32,813 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2022-04-08 04:02:32,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 04:02:32,813 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 106 [2022-04-08 04:02:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:02:32,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:02:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 96 transitions. [2022-04-08 04:02:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:02:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 96 transitions. [2022-04-08 04:02:32,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 96 transitions. [2022-04-08 04:02:32,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:32,894 INFO L225 Difference]: With dead ends: 122 [2022-04-08 04:02:32,894 INFO L226 Difference]: Without dead ends: 120 [2022-04-08 04:02:32,895 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 88 SyntacticMatches, 18 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=511, Invalid=6131, Unknown=0, NotChecked=0, Total=6642 [2022-04-08 04:02:32,896 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 75 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-08 04:02:32,896 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 142 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 04:02:32,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-08 04:02:32,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2022-04-08 04:02:32,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:02:32,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:02:32,975 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:02:32,975 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:02:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:32,976 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-08 04:02:32,976 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-08 04:02:32,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:32,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:32,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-08 04:02:32,977 INFO L87 Difference]: Start difference. First operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-08 04:02:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:32,978 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-08 04:02:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-08 04:02:32,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:32,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:32,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:02:32,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:02:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:02:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2022-04-08 04:02:32,980 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 106 [2022-04-08 04:02:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:02:32,980 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2022-04-08 04:02:32,980 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:02:32,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 118 transitions. [2022-04-08 04:02:33,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2022-04-08 04:02:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-08 04:02:33,181 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:02:33,181 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:02:33,198 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-08 04:02:33,382 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:33,382 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:02:33,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:02:33,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2058059454, now seen corresponding path program 37 times [2022-04-08 04:02:33,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:33,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2069361960] [2022-04-08 04:02:33,384 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:02:33,384 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:02:33,384 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:02:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2058059454, now seen corresponding path program 38 times [2022-04-08 04:02:33,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:02:33,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225096044] [2022-04-08 04:02:33,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:02:33,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:02:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:33,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:02:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:33,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {16476#(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(9, 2); {16408#true} is VALID [2022-04-08 04:02:33,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-08 04:02:33,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-08 04:02:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:33,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} #68#return; {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-08 04:02:33,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 04:02:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:33,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16430#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:33,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-08 04:02:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:33,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16435#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:33,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-08 04:02:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:33,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16440#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:33,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-08 04:02:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:33,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16445#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:33,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-08 04:02:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:33,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16450#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:33,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-08 04:02:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:33,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16455#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:33,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-08 04:02:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:33,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16460#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:33,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-08 04:02:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:33,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16465#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:33,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-08 04:02:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:33,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16470#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:33,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {16408#true} call ULTIMATE.init(); {16476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:02:33,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {16476#(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(9, 2); {16408#true} is VALID [2022-04-08 04:02:33,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-08 04:02:33,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-08 04:02:33,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {16408#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16408#true} is VALID [2022-04-08 04:02:33,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {16408#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {16413#(= main_~i~0 0)} is VALID [2022-04-08 04:02:33,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {16413#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16413#(= main_~i~0 0)} is VALID [2022-04-08 04:02:33,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {16413#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16414#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:33,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {16414#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16414#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:33,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {16414#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16415#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:33,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {16415#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16415#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:33,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {16415#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16416#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:33,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {16416#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16416#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:33,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {16416#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16417#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:33,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {16417#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16417#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:33,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {16417#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16418#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:33,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {16418#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16418#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:33,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {16418#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16419#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:33,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {16419#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16419#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:33,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {16419#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16420#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:33,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {16420#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16420#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:33,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {16420#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16421#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:33,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {16421#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16421#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:33,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {16421#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16422#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:33,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {16422#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16422#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:33,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {16422#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16423#(<= main_~i~0 10)} is VALID [2022-04-08 04:02:33,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {16423#(<= main_~i~0 10)} assume !(~i~0 < ~n~0); {16424#(<= main_~n~0 10)} is VALID [2022-04-08 04:02:33,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {16424#(<= main_~n~0 10)} ~i~1 := 0; {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-08 04:02:33,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-08 04:02:33,696 INFO L272 TraceCheckUtils]: 30: Hoare triple {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:33,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,697 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16408#true} {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} #68#return; {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-08 04:02:33,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} havoc #t~mem5; {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-08 04:02:33,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:33,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:33,698 INFO L272 TraceCheckUtils]: 38: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:33,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,698 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16408#true} {16430#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:33,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:33,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:33,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:33,699 INFO L272 TraceCheckUtils]: 46: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:33,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,700 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16408#true} {16435#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:33,700 INFO L290 TraceCheckUtils]: 51: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:33,700 INFO L290 TraceCheckUtils]: 52: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:33,701 INFO L290 TraceCheckUtils]: 53: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:33,701 INFO L272 TraceCheckUtils]: 54: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:33,701 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,701 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,701 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16408#true} {16440#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:33,702 INFO L290 TraceCheckUtils]: 59: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:33,702 INFO L290 TraceCheckUtils]: 60: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:33,702 INFO L290 TraceCheckUtils]: 61: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:33,702 INFO L272 TraceCheckUtils]: 62: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:33,702 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,702 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,703 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,703 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16408#true} {16445#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:33,703 INFO L290 TraceCheckUtils]: 67: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:33,704 INFO L290 TraceCheckUtils]: 68: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:33,704 INFO L290 TraceCheckUtils]: 69: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:33,704 INFO L272 TraceCheckUtils]: 70: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:33,704 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,704 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,704 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,704 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16408#true} {16450#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:33,705 INFO L290 TraceCheckUtils]: 75: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:33,705 INFO L290 TraceCheckUtils]: 76: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:33,705 INFO L290 TraceCheckUtils]: 77: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:33,705 INFO L272 TraceCheckUtils]: 78: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:33,705 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,706 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,706 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,706 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16408#true} {16455#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:33,706 INFO L290 TraceCheckUtils]: 83: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:33,707 INFO L290 TraceCheckUtils]: 84: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:33,707 INFO L290 TraceCheckUtils]: 85: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:33,707 INFO L272 TraceCheckUtils]: 86: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:33,707 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,707 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,707 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,707 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16408#true} {16460#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:33,708 INFO L290 TraceCheckUtils]: 91: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:33,708 INFO L290 TraceCheckUtils]: 92: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:33,708 INFO L290 TraceCheckUtils]: 93: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:33,708 INFO L272 TraceCheckUtils]: 94: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:33,709 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,709 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,709 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,709 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16408#true} {16465#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:33,709 INFO L290 TraceCheckUtils]: 99: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:33,710 INFO L290 TraceCheckUtils]: 100: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:33,710 INFO L290 TraceCheckUtils]: 101: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:33,710 INFO L272 TraceCheckUtils]: 102: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:33,710 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:33,710 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:33,710 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:33,711 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {16408#true} {16470#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:33,711 INFO L290 TraceCheckUtils]: 107: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:33,711 INFO L290 TraceCheckUtils]: 108: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16475#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:02:33,711 INFO L290 TraceCheckUtils]: 109: Hoare triple {16475#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16409#false} is VALID [2022-04-08 04:02:33,712 INFO L272 TraceCheckUtils]: 110: Hoare triple {16409#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16409#false} is VALID [2022-04-08 04:02:33,712 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-08 04:02:33,712 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-08 04:02:33,712 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-08 04:02:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 183 proven. 137 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 04:02:33,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:02:33,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225096044] [2022-04-08 04:02:33,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225096044] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:02:33,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061825224] [2022-04-08 04:02:33,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:02:33,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:33,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:02:33,714 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-08 04:02:33,714 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-08 04:02:33,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:02:33,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:02:33,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 04:02:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:33,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:02:34,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {16408#true} call ULTIMATE.init(); {16408#true} is VALID [2022-04-08 04:02:34,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#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(9, 2); {16408#true} is VALID [2022-04-08 04:02:34,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:34,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-08 04:02:34,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-08 04:02:34,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {16408#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16408#true} is VALID [2022-04-08 04:02:34,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {16408#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {16498#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:34,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {16498#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16498#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:34,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {16498#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16414#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:34,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {16414#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16414#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:34,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {16414#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16415#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:34,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {16415#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16415#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:34,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {16415#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16416#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:34,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {16416#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16416#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:34,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {16416#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16417#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:34,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {16417#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16417#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:34,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {16417#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16418#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:34,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {16418#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16418#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:34,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {16418#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16419#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:34,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {16419#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16419#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:34,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {16419#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16420#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:34,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {16420#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16420#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:34,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {16420#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16421#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:34,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {16421#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16421#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:34,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {16421#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16422#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:34,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {16422#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16422#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:34,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {16422#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16423#(<= main_~i~0 10)} is VALID [2022-04-08 04:02:34,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {16423#(<= main_~i~0 10)} assume !(~i~0 < ~n~0); {16424#(<= main_~n~0 10)} is VALID [2022-04-08 04:02:34,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {16424#(<= main_~n~0 10)} ~i~1 := 0; {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} is VALID [2022-04-08 04:02:34,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} is VALID [2022-04-08 04:02:34,613 INFO L272 TraceCheckUtils]: 30: Hoare triple {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:34,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:34,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:34,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:34,614 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16408#true} {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} #68#return; {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} is VALID [2022-04-08 04:02:34,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} havoc #t~mem5; {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} is VALID [2022-04-08 04:02:34,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-08 04:02:34,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-08 04:02:34,615 INFO L272 TraceCheckUtils]: 38: Hoare triple {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:34,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:34,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:34,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:34,616 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16408#true} {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} #68#return; {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-08 04:02:34,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} havoc #t~mem5; {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-08 04:02:34,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} is VALID [2022-04-08 04:02:34,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} is VALID [2022-04-08 04:02:34,617 INFO L272 TraceCheckUtils]: 46: Hoare triple {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:34,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:34,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:34,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:34,618 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16408#true} {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} #68#return; {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} is VALID [2022-04-08 04:02:34,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} havoc #t~mem5; {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} is VALID [2022-04-08 04:02:34,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} is VALID [2022-04-08 04:02:34,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} is VALID [2022-04-08 04:02:34,619 INFO L272 TraceCheckUtils]: 54: Hoare triple {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:34,619 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:34,619 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:34,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:34,620 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16408#true} {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} #68#return; {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} is VALID [2022-04-08 04:02:34,620 INFO L290 TraceCheckUtils]: 59: Hoare triple {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} havoc #t~mem5; {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} is VALID [2022-04-08 04:02:34,620 INFO L290 TraceCheckUtils]: 60: Hoare triple {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} is VALID [2022-04-08 04:02:34,621 INFO L290 TraceCheckUtils]: 61: Hoare triple {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} is VALID [2022-04-08 04:02:34,621 INFO L272 TraceCheckUtils]: 62: Hoare triple {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:34,621 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:34,621 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:34,621 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:34,621 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16408#true} {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} #68#return; {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} is VALID [2022-04-08 04:02:34,622 INFO L290 TraceCheckUtils]: 67: Hoare triple {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} havoc #t~mem5; {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} is VALID [2022-04-08 04:02:34,622 INFO L290 TraceCheckUtils]: 68: Hoare triple {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} is VALID [2022-04-08 04:02:34,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} is VALID [2022-04-08 04:02:34,622 INFO L272 TraceCheckUtils]: 70: Hoare triple {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:34,622 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:34,623 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:34,623 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:34,623 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16408#true} {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} #68#return; {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} is VALID [2022-04-08 04:02:34,624 INFO L290 TraceCheckUtils]: 75: Hoare triple {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} havoc #t~mem5; {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} is VALID [2022-04-08 04:02:34,624 INFO L290 TraceCheckUtils]: 76: Hoare triple {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-08 04:02:34,625 INFO L290 TraceCheckUtils]: 77: Hoare triple {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-08 04:02:34,625 INFO L272 TraceCheckUtils]: 78: Hoare triple {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:34,625 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:34,625 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:34,625 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:34,625 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16408#true} {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} #68#return; {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-08 04:02:34,626 INFO L290 TraceCheckUtils]: 83: Hoare triple {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} havoc #t~mem5; {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-08 04:02:34,626 INFO L290 TraceCheckUtils]: 84: Hoare triple {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} is VALID [2022-04-08 04:02:34,627 INFO L290 TraceCheckUtils]: 85: Hoare triple {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} is VALID [2022-04-08 04:02:34,627 INFO L272 TraceCheckUtils]: 86: Hoare triple {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:34,627 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:34,627 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:34,627 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:34,627 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16408#true} {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} #68#return; {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} is VALID [2022-04-08 04:02:34,628 INFO L290 TraceCheckUtils]: 91: Hoare triple {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} havoc #t~mem5; {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} is VALID [2022-04-08 04:02:34,628 INFO L290 TraceCheckUtils]: 92: Hoare triple {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} is VALID [2022-04-08 04:02:34,628 INFO L290 TraceCheckUtils]: 93: Hoare triple {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} is VALID [2022-04-08 04:02:34,628 INFO L272 TraceCheckUtils]: 94: Hoare triple {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:34,628 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:34,629 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:34,629 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:34,629 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16408#true} {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} #68#return; {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} is VALID [2022-04-08 04:02:34,629 INFO L290 TraceCheckUtils]: 99: Hoare triple {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} havoc #t~mem5; {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} is VALID [2022-04-08 04:02:34,630 INFO L290 TraceCheckUtils]: 100: Hoare triple {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} is VALID [2022-04-08 04:02:34,630 INFO L290 TraceCheckUtils]: 101: Hoare triple {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} is VALID [2022-04-08 04:02:34,630 INFO L272 TraceCheckUtils]: 102: Hoare triple {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:34,630 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:34,630 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:34,630 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:34,631 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {16408#true} {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} #68#return; {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} is VALID [2022-04-08 04:02:34,631 INFO L290 TraceCheckUtils]: 107: Hoare triple {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} havoc #t~mem5; {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} is VALID [2022-04-08 04:02:34,631 INFO L290 TraceCheckUtils]: 108: Hoare triple {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16815#(and (<= 10 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-08 04:02:34,632 INFO L290 TraceCheckUtils]: 109: Hoare triple {16815#(and (<= 10 main_~i~1) (<= main_~n~0 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16409#false} is VALID [2022-04-08 04:02:34,632 INFO L272 TraceCheckUtils]: 110: Hoare triple {16409#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16409#false} is VALID [2022-04-08 04:02:34,632 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-08 04:02:34,632 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-08 04:02:34,632 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-08 04:02:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 220 proven. 100 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 04:02:34,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:02:35,111 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-08 04:02:35,111 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-08 04:02:35,111 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-08 04:02:35,111 INFO L272 TraceCheckUtils]: 110: Hoare triple {16409#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16409#false} is VALID [2022-04-08 04:02:35,111 INFO L290 TraceCheckUtils]: 109: Hoare triple {16475#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16409#false} is VALID [2022-04-08 04:02:35,112 INFO L290 TraceCheckUtils]: 108: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16475#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:02:35,112 INFO L290 TraceCheckUtils]: 107: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:35,113 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {16408#true} {16470#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:35,113 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:35,113 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:35,113 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:35,113 INFO L272 TraceCheckUtils]: 102: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:35,113 INFO L290 TraceCheckUtils]: 101: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:35,114 INFO L290 TraceCheckUtils]: 100: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:35,114 INFO L290 TraceCheckUtils]: 99: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:35,114 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16408#true} {16465#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:35,114 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:35,114 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:35,114 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:35,115 INFO L272 TraceCheckUtils]: 94: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:35,115 INFO L290 TraceCheckUtils]: 93: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:35,115 INFO L290 TraceCheckUtils]: 92: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:35,116 INFO L290 TraceCheckUtils]: 91: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:35,116 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16408#true} {16460#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:35,116 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:35,116 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:35,116 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:35,116 INFO L272 TraceCheckUtils]: 86: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:35,117 INFO L290 TraceCheckUtils]: 85: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:35,117 INFO L290 TraceCheckUtils]: 84: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:35,117 INFO L290 TraceCheckUtils]: 83: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:35,118 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16408#true} {16455#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:35,118 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:35,118 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:35,118 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:35,118 INFO L272 TraceCheckUtils]: 78: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:35,118 INFO L290 TraceCheckUtils]: 77: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:35,119 INFO L290 TraceCheckUtils]: 76: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:35,119 INFO L290 TraceCheckUtils]: 75: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:35,119 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16408#true} {16450#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:35,119 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:35,119 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:35,120 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:35,120 INFO L272 TraceCheckUtils]: 70: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:35,121 INFO L290 TraceCheckUtils]: 69: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:35,121 INFO L290 TraceCheckUtils]: 68: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:35,122 INFO L290 TraceCheckUtils]: 67: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:35,122 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16408#true} {16445#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:35,122 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:35,122 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:35,123 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:35,123 INFO L272 TraceCheckUtils]: 62: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:35,123 INFO L290 TraceCheckUtils]: 61: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:35,125 INFO L290 TraceCheckUtils]: 60: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:35,126 INFO L290 TraceCheckUtils]: 59: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:35,126 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16408#true} {16440#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:35,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:35,127 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:35,127 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:35,127 INFO L272 TraceCheckUtils]: 54: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:35,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:35,128 INFO L290 TraceCheckUtils]: 52: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:35,128 INFO L290 TraceCheckUtils]: 51: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:35,128 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16408#true} {16435#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:35,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:35,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:35,129 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:35,129 INFO L272 TraceCheckUtils]: 46: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:35,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:35,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:35,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:35,130 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16408#true} {16430#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:35,130 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:35,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:35,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:35,131 INFO L272 TraceCheckUtils]: 38: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:35,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:35,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {17062#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:35,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {17062#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {17062#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:02:35,132 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16408#true} {17062#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {17062#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:02:35,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:35,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-08 04:02:35,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-08 04:02:35,133 INFO L272 TraceCheckUtils]: 30: Hoare triple {17062#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-08 04:02:35,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {17062#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17062#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:02:35,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {16424#(<= main_~n~0 10)} ~i~1 := 0; {17062#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:02:35,134 INFO L290 TraceCheckUtils]: 27: Hoare triple {16423#(<= main_~i~0 10)} assume !(~i~0 < ~n~0); {16424#(<= main_~n~0 10)} is VALID [2022-04-08 04:02:35,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {16422#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16423#(<= main_~i~0 10)} is VALID [2022-04-08 04:02:35,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {16422#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16422#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:35,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {16421#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16422#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:35,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {16421#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16421#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:35,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {16420#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16421#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:35,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {16420#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16420#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:35,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {16419#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16420#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:35,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {16419#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16419#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:35,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {16418#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16419#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:35,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {16418#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16418#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:35,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {16417#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16418#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:35,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {16417#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16417#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:35,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {16416#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16417#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:35,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {16416#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16416#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:35,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {16415#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16416#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:35,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {16415#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16415#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:35,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {16414#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16415#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:35,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {16414#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16414#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:35,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {16498#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16414#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:35,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {16498#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16498#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:35,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {16408#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {16498#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:35,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {16408#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16408#true} is VALID [2022-04-08 04:02:35,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-08 04:02:35,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-08 04:02:35,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-08 04:02:35,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#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(9, 2); {16408#true} is VALID [2022-04-08 04:02:35,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {16408#true} call ULTIMATE.init(); {16408#true} is VALID [2022-04-08 04:02:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 220 proven. 100 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 04:02:35,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061825224] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:02:35,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 04:02:35,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 39 [2022-04-08 04:02:35,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:02:35,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2069361960] [2022-04-08 04:02:35,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2069361960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:02:35,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:02:35,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 04:02:35,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867657642] [2022-04-08 04:02:35,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:02:35,162 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 114 [2022-04-08 04:02:35,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:02:35,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:35,217 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-08 04:02:35,218 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 04:02:35,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:35,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 04:02:35,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1151, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 04:02:35,219 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:36,284 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2022-04-08 04:02:36,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 04:02:36,284 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 114 [2022-04-08 04:02:36,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:02:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-08 04:02:36,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-08 04:02:36,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 106 transitions. [2022-04-08 04:02:36,367 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-08 04:02:36,368 INFO L225 Difference]: With dead ends: 172 [2022-04-08 04:02:36,368 INFO L226 Difference]: Without dead ends: 120 [2022-04-08 04:02:36,369 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=682, Invalid=3100, Unknown=0, NotChecked=0, Total=3782 [2022-04-08 04:02:36,369 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 52 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 04:02:36,369 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 65 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 04:02:36,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-08 04:02:36,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-04-08 04:02:36,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:02:36,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:02:36,447 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:02:36,447 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:02:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:36,448 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-08 04:02:36,448 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-08 04:02:36,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:36,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:36,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-08 04:02:36,449 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-08 04:02:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:36,450 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-08 04:02:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-08 04:02:36,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:36,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:36,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:02:36,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:02:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:02:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-04-08 04:02:36,452 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-04-08 04:02:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:02:36,452 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-04-08 04:02:36,452 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:36,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 120 transitions. [2022-04-08 04:02:36,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-04-08 04:02:36,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-08 04:02:36,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:02:36,637 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:02:36,653 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-08 04:02:36,837 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,SelfDestructingSolverStorable20 [2022-04-08 04:02:36,837 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:02:36,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:02:36,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1880118428, now seen corresponding path program 39 times [2022-04-08 04:02:36,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:36,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1302012695] [2022-04-08 04:02:36,844 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:02:36,844 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:02:36,844 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:02:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1880118428, now seen corresponding path program 40 times [2022-04-08 04:02:36,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:02:36,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650919150] [2022-04-08 04:02:36,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:02:36,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:02:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:37,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:02:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:37,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {18113#(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(9, 2); {18041#true} is VALID [2022-04-08 04:02:37,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-08 04:02:37,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-08 04:02:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:37,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} #68#return; {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:02:37,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-08 04:02:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:37,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:02:37,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 04:02:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:37,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:37,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-08 04:02:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:37,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:37,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-08 04:02:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:37,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:37,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 04:02:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:37,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:37,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-08 04:02:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:37,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:37,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-08 04:02:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:37,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:37,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-08 04:02:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:37,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:37,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-08 04:02:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:37,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:37,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {18041#true} call ULTIMATE.init(); {18113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:02:37,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {18113#(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(9, 2); {18041#true} is VALID [2022-04-08 04:02:37,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-08 04:02:37,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {18041#true} call #t~ret6 := main(); {18041#true} is VALID [2022-04-08 04:02:37,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {18041#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {18041#true} is VALID [2022-04-08 04:02:37,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {18041#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {18046#(= main_~i~0 0)} is VALID [2022-04-08 04:02:37,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {18046#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18046#(= main_~i~0 0)} is VALID [2022-04-08 04:02:37,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {18046#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18047#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:02:37,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {18047#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18047#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:02:37,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {18047#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18048#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:02:37,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {18048#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18048#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:02:37,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {18048#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18049#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:02:37,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {18049#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18049#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:02:37,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {18049#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18050#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:02:37,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {18050#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18050#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:02:37,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {18050#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18051#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:02:37,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {18051#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18051#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:02:37,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {18051#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18052#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:02:37,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {18052#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18052#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:02:37,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {18052#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18053#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:02:37,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {18053#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18053#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:02:37,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {18053#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18054#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:02:37,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {18054#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18054#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:02:37,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {18054#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18055#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:02:37,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {18055#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18055#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:02:37,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {18055#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18056#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-08 04:02:37,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {18056#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18057#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-08 04:02:37,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {18057#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18058#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0)} is VALID [2022-04-08 04:02:37,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {18058#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0)} assume !(~i~0 < ~n~0); {18058#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0)} is VALID [2022-04-08 04:02:37,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {18058#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0)} ~i~1 := 0; {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:02:37,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:02:37,416 INFO L272 TraceCheckUtils]: 32: Hoare triple {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-08 04:02:37,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,417 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18041#true} {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} #68#return; {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:02:37,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} havoc #t~mem5; {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:02:37,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:02:37,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:02:37,418 INFO L272 TraceCheckUtils]: 40: Hoare triple {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-08 04:02:37,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,418 INFO L290 TraceCheckUtils]: 42: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,418 INFO L290 TraceCheckUtils]: 43: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,419 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18041#true} {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:02:37,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:02:37,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:37,420 INFO L290 TraceCheckUtils]: 47: Hoare triple {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:37,420 INFO L272 TraceCheckUtils]: 48: Hoare triple {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-08 04:02:37,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,420 INFO L290 TraceCheckUtils]: 51: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,421 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18041#true} {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:37,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:37,421 INFO L290 TraceCheckUtils]: 54: Hoare triple {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:37,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:37,422 INFO L272 TraceCheckUtils]: 56: Hoare triple {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-08 04:02:37,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,422 INFO L290 TraceCheckUtils]: 58: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,422 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18041#true} {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:37,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:37,423 INFO L290 TraceCheckUtils]: 62: Hoare triple {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:37,423 INFO L290 TraceCheckUtils]: 63: Hoare triple {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:37,423 INFO L272 TraceCheckUtils]: 64: Hoare triple {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-08 04:02:37,423 INFO L290 TraceCheckUtils]: 65: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,424 INFO L290 TraceCheckUtils]: 66: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,424 INFO L290 TraceCheckUtils]: 67: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,424 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18041#true} {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:37,424 INFO L290 TraceCheckUtils]: 69: Hoare triple {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:37,425 INFO L290 TraceCheckUtils]: 70: Hoare triple {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:37,425 INFO L290 TraceCheckUtils]: 71: Hoare triple {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:37,425 INFO L272 TraceCheckUtils]: 72: Hoare triple {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-08 04:02:37,425 INFO L290 TraceCheckUtils]: 73: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,425 INFO L290 TraceCheckUtils]: 74: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,425 INFO L290 TraceCheckUtils]: 75: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,426 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {18041#true} {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:37,426 INFO L290 TraceCheckUtils]: 77: Hoare triple {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:37,426 INFO L290 TraceCheckUtils]: 78: Hoare triple {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:37,427 INFO L290 TraceCheckUtils]: 79: Hoare triple {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:37,427 INFO L272 TraceCheckUtils]: 80: Hoare triple {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-08 04:02:37,427 INFO L290 TraceCheckUtils]: 81: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,427 INFO L290 TraceCheckUtils]: 82: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,427 INFO L290 TraceCheckUtils]: 83: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,427 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18041#true} {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:37,428 INFO L290 TraceCheckUtils]: 85: Hoare triple {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:37,428 INFO L290 TraceCheckUtils]: 86: Hoare triple {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:37,429 INFO L290 TraceCheckUtils]: 87: Hoare triple {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:37,429 INFO L272 TraceCheckUtils]: 88: Hoare triple {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-08 04:02:37,429 INFO L290 TraceCheckUtils]: 89: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,429 INFO L290 TraceCheckUtils]: 90: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,429 INFO L290 TraceCheckUtils]: 91: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,429 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {18041#true} {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:37,430 INFO L290 TraceCheckUtils]: 93: Hoare triple {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:37,430 INFO L290 TraceCheckUtils]: 94: Hoare triple {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:37,430 INFO L290 TraceCheckUtils]: 95: Hoare triple {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:37,430 INFO L272 TraceCheckUtils]: 96: Hoare triple {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-08 04:02:37,431 INFO L290 TraceCheckUtils]: 97: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,431 INFO L290 TraceCheckUtils]: 98: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,431 INFO L290 TraceCheckUtils]: 99: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,431 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {18041#true} {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:37,431 INFO L290 TraceCheckUtils]: 101: Hoare triple {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:37,432 INFO L290 TraceCheckUtils]: 102: Hoare triple {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:37,432 INFO L290 TraceCheckUtils]: 103: Hoare triple {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:37,432 INFO L272 TraceCheckUtils]: 104: Hoare triple {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-08 04:02:37,432 INFO L290 TraceCheckUtils]: 105: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-08 04:02:37,432 INFO L290 TraceCheckUtils]: 106: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-08 04:02:37,433 INFO L290 TraceCheckUtils]: 107: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:37,433 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18041#true} {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:37,433 INFO L290 TraceCheckUtils]: 109: Hoare triple {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:37,434 INFO L290 TraceCheckUtils]: 110: Hoare triple {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18109#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:37,434 INFO L290 TraceCheckUtils]: 111: Hoare triple {18109#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18110#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:02:37,435 INFO L272 TraceCheckUtils]: 112: Hoare triple {18110#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:02:37,435 INFO L290 TraceCheckUtils]: 113: Hoare triple {18111#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {18112#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:02:37,435 INFO L290 TraceCheckUtils]: 114: Hoare triple {18112#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18042#false} is VALID [2022-04-08 04:02:37,435 INFO L290 TraceCheckUtils]: 115: Hoare triple {18042#false} assume !false; {18042#false} is VALID [2022-04-08 04:02:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 20 proven. 321 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 04:02:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:02:37,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650919150] [2022-04-08 04:02:37,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650919150] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:02:37,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165929901] [2022-04-08 04:02:37,436 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:02:37,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:37,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:02:37,446 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-08 04:02:37,447 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-08 04:02:37,562 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:02:37,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:02:37,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-08 04:02:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:37,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:02:37,955 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-08 04:02:46,002 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-08 04:02:46,002 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 23 treesize of output 10 [2022-04-08 04:02:46,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {18041#true} call ULTIMATE.init(); {18041#true} is VALID [2022-04-08 04:02:46,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#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(9, 2); {18041#true} is VALID [2022-04-08 04:02:46,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-08 04:02:46,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-08 04:02:46,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {18041#true} call #t~ret6 := main(); {18041#true} is VALID [2022-04-08 04:02:46,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {18041#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {18041#true} is VALID [2022-04-08 04:02:46,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {18041#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {18135#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:46,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {18135#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18135#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:46,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {18135#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18142#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:46,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {18142#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18142#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:46,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {18142#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18149#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:46,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {18149#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18149#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:46,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {18149#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18156#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:46,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {18156#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18156#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:46,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {18156#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18163#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:46,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {18163#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18163#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:46,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {18163#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18170#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:46,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {18170#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18170#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:46,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {18170#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18177#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:46,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {18177#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18177#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:46,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {18177#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18184#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:46,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {18184#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18184#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:46,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {18184#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18191#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:46,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {18191#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18191#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:46,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {18191#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18198#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:46,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {18198#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18198#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:46,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {18198#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18205#(<= main_~i~0 10)} is VALID [2022-04-08 04:02:46,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {18205#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18209#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 10))} is VALID [2022-04-08 04:02:46,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {18209#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 10))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18213#(exists ((v_main_~i~0_243 Int)) (and (<= main_~i~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10)))} is VALID [2022-04-08 04:02:46,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {18213#(exists ((v_main_~i~0_243 Int)) (and (<= main_~i~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10)))} assume !(~i~0 < ~n~0); {18217#(exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10)))} is VALID [2022-04-08 04:02:46,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {18217#(exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10)))} ~i~1 := 0; {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,119 INFO L272 TraceCheckUtils]: 32: Hoare triple {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,145 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,147 INFO L290 TraceCheckUtils]: 39: Hoare triple {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,148 INFO L272 TraceCheckUtils]: 40: Hoare triple {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,148 INFO L290 TraceCheckUtils]: 41: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,149 INFO L290 TraceCheckUtils]: 42: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,151 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,152 INFO L290 TraceCheckUtils]: 45: Hoare triple {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,152 INFO L290 TraceCheckUtils]: 46: Hoare triple {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:02:46,153 INFO L290 TraceCheckUtils]: 47: Hoare triple {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:02:46,154 INFO L272 TraceCheckUtils]: 48: Hoare triple {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,157 INFO L290 TraceCheckUtils]: 50: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,158 INFO L290 TraceCheckUtils]: 51: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,159 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} #68#return; {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:02:46,160 INFO L290 TraceCheckUtils]: 53: Hoare triple {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} havoc #t~mem5; {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:02:46,160 INFO L290 TraceCheckUtils]: 54: Hoare triple {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:02:46,161 INFO L290 TraceCheckUtils]: 55: Hoare triple {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:02:46,162 INFO L272 TraceCheckUtils]: 56: Hoare triple {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,164 INFO L290 TraceCheckUtils]: 59: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,164 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} #68#return; {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:02:46,165 INFO L290 TraceCheckUtils]: 61: Hoare triple {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} havoc #t~mem5; {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:02:46,165 INFO L290 TraceCheckUtils]: 62: Hoare triple {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:02:46,166 INFO L290 TraceCheckUtils]: 63: Hoare triple {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:02:46,167 INFO L272 TraceCheckUtils]: 64: Hoare triple {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,167 INFO L290 TraceCheckUtils]: 65: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,171 INFO L290 TraceCheckUtils]: 66: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,171 INFO L290 TraceCheckUtils]: 67: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,172 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} #68#return; {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:02:46,173 INFO L290 TraceCheckUtils]: 69: Hoare triple {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} havoc #t~mem5; {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:02:46,173 INFO L290 TraceCheckUtils]: 70: Hoare triple {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,174 INFO L290 TraceCheckUtils]: 71: Hoare triple {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,175 INFO L272 TraceCheckUtils]: 72: Hoare triple {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,181 INFO L290 TraceCheckUtils]: 73: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,184 INFO L290 TraceCheckUtils]: 74: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,184 INFO L290 TraceCheckUtils]: 75: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,185 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,185 INFO L290 TraceCheckUtils]: 77: Hoare triple {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,186 INFO L290 TraceCheckUtils]: 78: Hoare triple {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,187 INFO L290 TraceCheckUtils]: 79: Hoare triple {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,188 INFO L272 TraceCheckUtils]: 80: Hoare triple {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,190 INFO L290 TraceCheckUtils]: 81: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,190 INFO L290 TraceCheckUtils]: 82: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,191 INFO L290 TraceCheckUtils]: 83: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,191 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,192 INFO L290 TraceCheckUtils]: 85: Hoare triple {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,193 INFO L290 TraceCheckUtils]: 86: Hoare triple {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,193 INFO L290 TraceCheckUtils]: 87: Hoare triple {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,194 INFO L272 TraceCheckUtils]: 88: Hoare triple {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,199 INFO L290 TraceCheckUtils]: 89: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,199 INFO L290 TraceCheckUtils]: 90: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,200 INFO L290 TraceCheckUtils]: 91: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,201 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,201 INFO L290 TraceCheckUtils]: 93: Hoare triple {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,202 INFO L290 TraceCheckUtils]: 94: Hoare triple {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,202 INFO L290 TraceCheckUtils]: 95: Hoare triple {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,203 INFO L272 TraceCheckUtils]: 96: Hoare triple {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,204 INFO L290 TraceCheckUtils]: 97: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,204 INFO L290 TraceCheckUtils]: 98: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,205 INFO L290 TraceCheckUtils]: 99: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,206 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,206 INFO L290 TraceCheckUtils]: 101: Hoare triple {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,207 INFO L290 TraceCheckUtils]: 102: Hoare triple {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} is VALID [2022-04-08 04:02:46,208 INFO L290 TraceCheckUtils]: 103: Hoare triple {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} is VALID [2022-04-08 04:02:46,208 INFO L272 TraceCheckUtils]: 104: Hoare triple {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,209 INFO L290 TraceCheckUtils]: 105: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,209 INFO L290 TraceCheckUtils]: 106: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,211 INFO L290 TraceCheckUtils]: 107: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-08 04:02:46,212 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} #68#return; {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} is VALID [2022-04-08 04:02:46,212 INFO L290 TraceCheckUtils]: 109: Hoare triple {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} havoc #t~mem5; {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} is VALID [2022-04-08 04:02:46,213 INFO L290 TraceCheckUtils]: 110: Hoare triple {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18472#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-08 04:02:46,213 INFO L290 TraceCheckUtils]: 111: Hoare triple {18472#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18110#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:02:46,214 INFO L272 TraceCheckUtils]: 112: Hoare triple {18110#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18479#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:02:46,214 INFO L290 TraceCheckUtils]: 113: Hoare triple {18479#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18483#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:02:46,214 INFO L290 TraceCheckUtils]: 114: Hoare triple {18483#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18042#false} is VALID [2022-04-08 04:02:46,215 INFO L290 TraceCheckUtils]: 115: Hoare triple {18042#false} assume !false; {18042#false} is VALID [2022-04-08 04:02:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 190 proven. 151 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 04:02:46,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:02:46,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165929901] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:02:46,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:02:46,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 58 [2022-04-08 04:02:46,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:02:46,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1302012695] [2022-04-08 04:02:46,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1302012695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:02:46,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:02:46,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-08 04:02:46,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099809016] [2022-04-08 04:02:46,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:02:46,504 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 116 [2022-04-08 04:02:46,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:02:46,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:46,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:46,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-08 04:02:46,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:46,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-08 04:02:46,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=3195, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 04:02:46,564 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:50,762 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2022-04-08 04:02:50,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 04:02:50,762 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 116 [2022-04-08 04:02:50,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:02:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 103 transitions. [2022-04-08 04:02:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 103 transitions. [2022-04-08 04:02:50,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 103 transitions. [2022-04-08 04:02:50,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:50,867 INFO L225 Difference]: With dead ends: 132 [2022-04-08 04:02:50,867 INFO L226 Difference]: Without dead ends: 130 [2022-04-08 04:02:50,868 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 96 SyntacticMatches, 20 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=575, Invalid=7081, Unknown=0, NotChecked=0, Total=7656 [2022-04-08 04:02:50,868 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 80 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-08 04:02:50,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 153 Invalid, 2394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-08 04:02:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-08 04:02:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-04-08 04:02:50,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:02:50,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:02:50,946 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:02:50,946 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:02:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:50,948 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-08 04:02:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-08 04:02:50,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:50,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:50,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 130 states. [2022-04-08 04:02:50,949 INFO L87 Difference]: Start difference. First operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 130 states. [2022-04-08 04:02:50,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:50,950 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-08 04:02:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-08 04:02:50,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:50,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:50,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:02:50,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:02:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:02:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-04-08 04:02:50,953 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 116 [2022-04-08 04:02:50,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:02:50,953 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-04-08 04:02:50,953 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:02:50,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 128 transitions. [2022-04-08 04:02:51,174 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-08 04:02:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-04-08 04:02:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-08 04:02:51,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:02:51,175 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:02:51,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-08 04:02:51,375 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,SelfDestructingSolverStorable21 [2022-04-08 04:02:51,375 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:02:51,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:02:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1566810506, now seen corresponding path program 41 times [2022-04-08 04:02:51,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:51,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1330845077] [2022-04-08 04:02:51,377 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:02:51,377 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:02:51,377 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:02:51,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1566810506, now seen corresponding path program 42 times [2022-04-08 04:02:51,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:02:51,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890695734] [2022-04-08 04:02:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:02:51,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:02:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:51,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:02:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:51,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {19423#(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(9, 2); {19349#true} is VALID [2022-04-08 04:02:51,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,692 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-08 04:02:51,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-08 04:02:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:51,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} #68#return; {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:51,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-08 04:02:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:51,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19372#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:02:51,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 04:02:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:51,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19377#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:51,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-08 04:02:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:51,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19382#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:51,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-08 04:02:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:51,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19387#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:51,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 04:02:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:51,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19392#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:51,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-08 04:02:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:51,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19397#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:51,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-08 04:02:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:51,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19402#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:51,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-08 04:02:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:51,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19407#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:51,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-08 04:02:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:51,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19412#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:51,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-04-08 04:02:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:51,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19417#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:51,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {19349#true} call ULTIMATE.init(); {19423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:02:51,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {19423#(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(9, 2); {19349#true} is VALID [2022-04-08 04:02:51,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-08 04:02:51,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-08 04:02:51,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {19349#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {19349#true} is VALID [2022-04-08 04:02:51,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {19349#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {19354#(= main_~i~0 0)} is VALID [2022-04-08 04:02:51,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {19354#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19354#(= main_~i~0 0)} is VALID [2022-04-08 04:02:51,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {19354#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19355#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:51,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {19355#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19355#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:51,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {19355#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19356#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:51,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {19356#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19356#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:51,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {19356#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19357#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:51,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {19357#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19357#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:51,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {19357#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19358#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:51,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {19358#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19358#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:51,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {19358#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19359#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:51,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {19359#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19359#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:51,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {19359#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19360#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:51,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {19360#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19360#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:51,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {19360#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19361#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:51,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {19361#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19361#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:51,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {19361#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19362#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:51,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {19362#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19362#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:51,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {19362#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19363#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:51,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {19363#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19363#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:51,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {19363#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19364#(<= main_~i~0 10)} is VALID [2022-04-08 04:02:51,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {19364#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19364#(<= main_~i~0 10)} is VALID [2022-04-08 04:02:51,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {19364#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19365#(<= main_~i~0 11)} is VALID [2022-04-08 04:02:51,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {19365#(<= main_~i~0 11)} assume !(~i~0 < ~n~0); {19366#(<= main_~n~0 11)} is VALID [2022-04-08 04:02:51,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {19366#(<= main_~n~0 11)} ~i~1 := 0; {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:51,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:51,732 INFO L272 TraceCheckUtils]: 32: Hoare triple {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:51,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,733 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19349#true} {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} #68#return; {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:51,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} havoc #t~mem5; {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:51,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:02:51,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:02:51,734 INFO L272 TraceCheckUtils]: 40: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:51,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,734 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,735 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19349#true} {19372#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:02:51,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:02:51,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:51,736 INFO L290 TraceCheckUtils]: 47: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:51,736 INFO L272 TraceCheckUtils]: 48: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:51,736 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,736 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,736 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19349#true} {19377#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:51,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:51,737 INFO L290 TraceCheckUtils]: 54: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:51,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:51,743 INFO L272 TraceCheckUtils]: 56: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:51,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,744 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19349#true} {19382#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:51,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:51,745 INFO L290 TraceCheckUtils]: 62: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:51,745 INFO L290 TraceCheckUtils]: 63: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:51,745 INFO L272 TraceCheckUtils]: 64: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:51,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,745 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,745 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,746 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19349#true} {19387#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:51,746 INFO L290 TraceCheckUtils]: 69: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:51,746 INFO L290 TraceCheckUtils]: 70: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:51,746 INFO L290 TraceCheckUtils]: 71: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:51,747 INFO L272 TraceCheckUtils]: 72: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:51,747 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,747 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,747 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,747 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19349#true} {19392#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:51,747 INFO L290 TraceCheckUtils]: 77: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:51,748 INFO L290 TraceCheckUtils]: 78: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:51,748 INFO L290 TraceCheckUtils]: 79: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:51,748 INFO L272 TraceCheckUtils]: 80: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:51,748 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,748 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,748 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,749 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {19349#true} {19397#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:51,749 INFO L290 TraceCheckUtils]: 85: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:51,749 INFO L290 TraceCheckUtils]: 86: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:51,749 INFO L290 TraceCheckUtils]: 87: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:51,750 INFO L272 TraceCheckUtils]: 88: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:51,750 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,750 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,750 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,750 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {19349#true} {19402#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:51,750 INFO L290 TraceCheckUtils]: 93: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:51,751 INFO L290 TraceCheckUtils]: 94: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:51,751 INFO L290 TraceCheckUtils]: 95: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:51,751 INFO L272 TraceCheckUtils]: 96: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:51,751 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,751 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,751 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,752 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {19349#true} {19407#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:51,752 INFO L290 TraceCheckUtils]: 101: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:51,752 INFO L290 TraceCheckUtils]: 102: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:51,753 INFO L290 TraceCheckUtils]: 103: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:51,753 INFO L272 TraceCheckUtils]: 104: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:51,753 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,753 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,753 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,753 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19349#true} {19412#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:51,753 INFO L290 TraceCheckUtils]: 109: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:51,754 INFO L290 TraceCheckUtils]: 110: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:51,754 INFO L290 TraceCheckUtils]: 111: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:51,754 INFO L272 TraceCheckUtils]: 112: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:51,754 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:51,754 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:51,754 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:51,755 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19349#true} {19417#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:51,755 INFO L290 TraceCheckUtils]: 117: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:51,755 INFO L290 TraceCheckUtils]: 118: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19422#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:02:51,756 INFO L290 TraceCheckUtils]: 119: Hoare triple {19422#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19350#false} is VALID [2022-04-08 04:02:51,756 INFO L272 TraceCheckUtils]: 120: Hoare triple {19350#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19350#false} is VALID [2022-04-08 04:02:51,756 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-08 04:02:51,756 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-08 04:02:51,756 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-08 04:02:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 223 proven. 162 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 04:02:51,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:02:51,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890695734] [2022-04-08 04:02:51,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890695734] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:02:51,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59421733] [2022-04-08 04:02:51,757 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:02:51,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:51,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:02:51,758 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-08 04:02:51,759 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-08 04:02:51,931 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-08 04:02:51,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:02:51,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 04:02:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:51,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:02:52,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {19349#true} call ULTIMATE.init(); {19349#true} is VALID [2022-04-08 04:02:52,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#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(9, 2); {19349#true} is VALID [2022-04-08 04:02:52,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:52,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-08 04:02:52,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-08 04:02:52,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {19349#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {19349#true} is VALID [2022-04-08 04:02:52,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {19349#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {19445#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:52,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {19445#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19445#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:52,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {19445#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19355#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:52,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {19355#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19355#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:52,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {19355#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19356#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:52,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {19356#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19356#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:52,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {19356#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19357#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:52,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {19357#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19357#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:52,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {19357#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19358#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:52,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {19358#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19358#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:52,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {19358#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19359#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:52,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {19359#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19359#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:52,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {19359#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19360#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:52,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {19360#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19360#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:52,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {19360#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19361#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:52,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {19361#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19361#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:52,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {19361#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19362#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:52,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {19362#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19362#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:52,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {19362#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19363#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:52,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {19363#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19363#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:52,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {19363#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19364#(<= main_~i~0 10)} is VALID [2022-04-08 04:02:52,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {19364#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19364#(<= main_~i~0 10)} is VALID [2022-04-08 04:02:52,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {19364#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19365#(<= main_~i~0 11)} is VALID [2022-04-08 04:02:52,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {19365#(<= main_~i~0 11)} assume !(~i~0 < ~n~0); {19366#(<= main_~n~0 11)} is VALID [2022-04-08 04:02:52,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {19366#(<= main_~n~0 11)} ~i~1 := 0; {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,835 INFO L272 TraceCheckUtils]: 32: Hoare triple {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:52,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:52,835 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:52,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:52,835 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19349#true} {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} #68#return; {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,836 INFO L290 TraceCheckUtils]: 38: Hoare triple {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,836 INFO L290 TraceCheckUtils]: 39: Hoare triple {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,837 INFO L272 TraceCheckUtils]: 40: Hoare triple {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:52,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:52,837 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:52,837 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:52,837 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19349#true} {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} #68#return; {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,837 INFO L290 TraceCheckUtils]: 45: Hoare triple {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,838 INFO L290 TraceCheckUtils]: 46: Hoare triple {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,838 INFO L290 TraceCheckUtils]: 47: Hoare triple {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,838 INFO L272 TraceCheckUtils]: 48: Hoare triple {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:52,838 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:52,838 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:52,838 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:52,839 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19349#true} {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} #68#return; {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,839 INFO L290 TraceCheckUtils]: 53: Hoare triple {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,840 INFO L290 TraceCheckUtils]: 54: Hoare triple {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,840 INFO L290 TraceCheckUtils]: 55: Hoare triple {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,840 INFO L272 TraceCheckUtils]: 56: Hoare triple {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:52,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:52,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:52,840 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:52,841 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19349#true} {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} #68#return; {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,841 INFO L290 TraceCheckUtils]: 61: Hoare triple {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,841 INFO L290 TraceCheckUtils]: 62: Hoare triple {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,842 INFO L290 TraceCheckUtils]: 63: Hoare triple {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,842 INFO L272 TraceCheckUtils]: 64: Hoare triple {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:52,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:52,842 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:52,842 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:52,842 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19349#true} {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} #68#return; {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,843 INFO L290 TraceCheckUtils]: 69: Hoare triple {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,843 INFO L290 TraceCheckUtils]: 70: Hoare triple {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,844 INFO L290 TraceCheckUtils]: 71: Hoare triple {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,844 INFO L272 TraceCheckUtils]: 72: Hoare triple {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:52,844 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:52,844 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:52,844 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:52,844 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19349#true} {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} #68#return; {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,845 INFO L290 TraceCheckUtils]: 77: Hoare triple {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,845 INFO L290 TraceCheckUtils]: 78: Hoare triple {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,845 INFO L290 TraceCheckUtils]: 79: Hoare triple {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,845 INFO L272 TraceCheckUtils]: 80: Hoare triple {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:52,845 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:52,845 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:52,846 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:52,846 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {19349#true} {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} #68#return; {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,846 INFO L290 TraceCheckUtils]: 85: Hoare triple {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,847 INFO L290 TraceCheckUtils]: 86: Hoare triple {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,847 INFO L290 TraceCheckUtils]: 87: Hoare triple {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,847 INFO L272 TraceCheckUtils]: 88: Hoare triple {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:52,847 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:52,847 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:52,847 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:52,848 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {19349#true} {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} #68#return; {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,848 INFO L290 TraceCheckUtils]: 93: Hoare triple {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,848 INFO L290 TraceCheckUtils]: 94: Hoare triple {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,849 INFO L290 TraceCheckUtils]: 95: Hoare triple {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,849 INFO L272 TraceCheckUtils]: 96: Hoare triple {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:52,849 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:52,849 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:52,849 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:52,849 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {19349#true} {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} #68#return; {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,850 INFO L290 TraceCheckUtils]: 101: Hoare triple {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,850 INFO L290 TraceCheckUtils]: 102: Hoare triple {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,851 INFO L290 TraceCheckUtils]: 103: Hoare triple {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,851 INFO L272 TraceCheckUtils]: 104: Hoare triple {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:52,851 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:52,851 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:52,851 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:52,851 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19349#true} {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} #68#return; {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,852 INFO L290 TraceCheckUtils]: 109: Hoare triple {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,852 INFO L290 TraceCheckUtils]: 110: Hoare triple {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,852 INFO L290 TraceCheckUtils]: 111: Hoare triple {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,852 INFO L272 TraceCheckUtils]: 112: Hoare triple {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:52,852 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:52,853 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:52,853 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:52,853 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19349#true} {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} #68#return; {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,853 INFO L290 TraceCheckUtils]: 117: Hoare triple {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,854 INFO L290 TraceCheckUtils]: 118: Hoare triple {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19793#(and (<= 11 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-08 04:02:52,854 INFO L290 TraceCheckUtils]: 119: Hoare triple {19793#(and (<= 11 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19350#false} is VALID [2022-04-08 04:02:52,854 INFO L272 TraceCheckUtils]: 120: Hoare triple {19350#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19350#false} is VALID [2022-04-08 04:02:52,854 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-08 04:02:52,854 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-08 04:02:52,854 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-08 04:02:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 264 proven. 121 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 04:02:52,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:02:53,378 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-08 04:02:53,379 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-08 04:02:53,379 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-08 04:02:53,379 INFO L272 TraceCheckUtils]: 120: Hoare triple {19350#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19350#false} is VALID [2022-04-08 04:02:53,379 INFO L290 TraceCheckUtils]: 119: Hoare triple {19422#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19350#false} is VALID [2022-04-08 04:02:53,403 INFO L290 TraceCheckUtils]: 118: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19422#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:02:53,403 INFO L290 TraceCheckUtils]: 117: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:53,404 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19349#true} {19417#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:53,404 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:53,404 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:53,404 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:53,404 INFO L272 TraceCheckUtils]: 112: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:53,404 INFO L290 TraceCheckUtils]: 111: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:53,405 INFO L290 TraceCheckUtils]: 110: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:02:53,405 INFO L290 TraceCheckUtils]: 109: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:53,406 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19349#true} {19412#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:53,406 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:53,406 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:53,406 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:53,406 INFO L272 TraceCheckUtils]: 104: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:53,406 INFO L290 TraceCheckUtils]: 103: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:53,407 INFO L290 TraceCheckUtils]: 102: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:02:53,407 INFO L290 TraceCheckUtils]: 101: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:53,407 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {19349#true} {19407#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:53,407 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:53,408 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:53,408 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:53,408 INFO L272 TraceCheckUtils]: 96: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:53,408 INFO L290 TraceCheckUtils]: 95: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:53,408 INFO L290 TraceCheckUtils]: 94: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:02:53,409 INFO L290 TraceCheckUtils]: 93: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:53,409 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {19349#true} {19402#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:53,409 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:53,409 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:53,409 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:53,409 INFO L272 TraceCheckUtils]: 88: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:53,410 INFO L290 TraceCheckUtils]: 87: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:53,410 INFO L290 TraceCheckUtils]: 86: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:02:53,410 INFO L290 TraceCheckUtils]: 85: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:53,411 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {19349#true} {19397#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:53,411 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:53,411 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:53,411 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:53,411 INFO L272 TraceCheckUtils]: 80: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:53,411 INFO L290 TraceCheckUtils]: 79: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:53,412 INFO L290 TraceCheckUtils]: 78: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:02:53,412 INFO L290 TraceCheckUtils]: 77: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:53,412 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19349#true} {19392#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:53,412 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:53,413 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:53,413 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:53,413 INFO L272 TraceCheckUtils]: 72: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:53,413 INFO L290 TraceCheckUtils]: 71: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:53,413 INFO L290 TraceCheckUtils]: 70: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:02:53,414 INFO L290 TraceCheckUtils]: 69: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:53,414 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19349#true} {19387#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:53,414 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:53,414 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:53,414 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:53,414 INFO L272 TraceCheckUtils]: 64: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:53,415 INFO L290 TraceCheckUtils]: 63: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:53,415 INFO L290 TraceCheckUtils]: 62: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:02:53,415 INFO L290 TraceCheckUtils]: 61: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:53,416 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19349#true} {19382#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:53,416 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:53,416 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:53,416 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:53,416 INFO L272 TraceCheckUtils]: 56: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:53,416 INFO L290 TraceCheckUtils]: 55: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:53,417 INFO L290 TraceCheckUtils]: 54: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:02:53,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:53,418 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19349#true} {19377#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:53,418 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:53,418 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:53,418 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:53,418 INFO L272 TraceCheckUtils]: 48: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:53,418 INFO L290 TraceCheckUtils]: 47: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:53,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:02:53,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:02:53,419 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19349#true} {19372#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:02:53,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:53,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:53,420 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:53,420 INFO L272 TraceCheckUtils]: 40: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:53,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:02:53,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {20064#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:02:53,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {20064#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {20064#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:02:53,421 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19349#true} {20064#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {20064#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:02:53,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:53,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-08 04:02:53,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-08 04:02:53,421 INFO L272 TraceCheckUtils]: 32: Hoare triple {20064#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-08 04:02:53,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {20064#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {20064#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:02:53,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {19366#(<= main_~n~0 11)} ~i~1 := 0; {20064#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:02:53,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {19365#(<= main_~i~0 11)} assume !(~i~0 < ~n~0); {19366#(<= main_~n~0 11)} is VALID [2022-04-08 04:02:53,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {19364#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19365#(<= main_~i~0 11)} is VALID [2022-04-08 04:02:53,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {19364#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19364#(<= main_~i~0 10)} is VALID [2022-04-08 04:02:53,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {19363#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19364#(<= main_~i~0 10)} is VALID [2022-04-08 04:02:53,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {19363#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19363#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:53,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {19362#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19363#(<= main_~i~0 9)} is VALID [2022-04-08 04:02:53,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {19362#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19362#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:53,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {19361#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19362#(<= main_~i~0 8)} is VALID [2022-04-08 04:02:53,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {19361#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19361#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:53,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {19360#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19361#(<= main_~i~0 7)} is VALID [2022-04-08 04:02:53,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {19360#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19360#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:53,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {19359#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19360#(<= main_~i~0 6)} is VALID [2022-04-08 04:02:53,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {19359#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19359#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:53,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {19358#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19359#(<= main_~i~0 5)} is VALID [2022-04-08 04:02:53,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {19358#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19358#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:53,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {19357#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19358#(<= main_~i~0 4)} is VALID [2022-04-08 04:02:53,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {19357#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19357#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:53,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {19356#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19357#(<= main_~i~0 3)} is VALID [2022-04-08 04:02:53,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {19356#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19356#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:53,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {19355#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19356#(<= main_~i~0 2)} is VALID [2022-04-08 04:02:53,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {19355#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19355#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:53,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {19445#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19355#(<= main_~i~0 1)} is VALID [2022-04-08 04:02:53,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {19445#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19445#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:53,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {19349#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {19445#(<= main_~i~0 0)} is VALID [2022-04-08 04:02:53,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {19349#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {19349#true} is VALID [2022-04-08 04:02:53,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-08 04:02:53,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-08 04:02:53,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-08 04:02:53,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#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(9, 2); {19349#true} is VALID [2022-04-08 04:02:53,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {19349#true} call ULTIMATE.init(); {19349#true} is VALID [2022-04-08 04:02:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 264 proven. 121 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 04:02:53,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59421733] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:02:53,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 04:02:53,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 42 [2022-04-08 04:02:53,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:02:53,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1330845077] [2022-04-08 04:02:53,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1330845077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:02:53,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:02:53,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 04:02:53,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343183909] [2022-04-08 04:02:53,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:02:53,439 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 124 [2022-04-08 04:02:53,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:02:53,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:02:53,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:53,495 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 04:02:53,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:53,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 04:02:53,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1338, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 04:02:53,496 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:02:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:54,565 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2022-04-08 04:02:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 04:02:54,565 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 124 [2022-04-08 04:02:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:02:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:02:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 113 transitions. [2022-04-08 04:02:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:02:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 113 transitions. [2022-04-08 04:02:54,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 113 transitions. [2022-04-08 04:02:54,673 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-08 04:02:54,674 INFO L225 Difference]: With dead ends: 186 [2022-04-08 04:02:54,674 INFO L226 Difference]: Without dead ends: 130 [2022-04-08 04:02:54,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=790, Invalid=3632, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 04:02:54,676 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 04:02:54,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 62 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 04:02:54,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-08 04:02:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-04-08 04:02:54,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:02:54,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:02:54,773 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:02:54,773 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:02:54,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:54,780 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-08 04:02:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-08 04:02:54,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:54,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:54,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 130 states. [2022-04-08 04:02:54,781 INFO L87 Difference]: Start difference. First operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 130 states. [2022-04-08 04:02:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:54,782 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-08 04:02:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-08 04:02:54,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:54,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:54,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:02:54,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:02:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:02:54,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2022-04-08 04:02:54,785 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2022-04-08 04:02:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:02:54,785 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2022-04-08 04:02:54,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:02:54,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 130 transitions. [2022-04-08 04:02:55,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-04-08 04:02:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-08 04:02:55,010 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:02:55,011 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:02:55,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 04:02:55,211 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:55,211 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:02:55,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:02:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1844578604, now seen corresponding path program 43 times [2022-04-08 04:02:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:55,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [535135718] [2022-04-08 04:02:55,214 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:02:55,214 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:02:55,214 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:02:55,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1844578604, now seen corresponding path program 44 times [2022-04-08 04:02:55,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:02:55,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911797898] [2022-04-08 04:02:55,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:02:55,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:02:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:55,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:02:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:55,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {21199#(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(9, 2); {21121#true} is VALID [2022-04-08 04:02:55,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-08 04:02:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-08 04:02:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:55,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:02:55,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-08 04:02:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:55,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-08 04:02:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:55,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:02:55,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-08 04:02:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:55,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-08 04:02:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:55,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:55,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-08 04:02:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:55,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:55,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 04:02:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:55,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:55,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-08 04:02:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:55,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-08 04:02:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:55,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:55,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-08 04:02:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:55,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:55,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-04-08 04:02:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:55,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:55,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:02:55,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {21199#(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(9, 2); {21121#true} is VALID [2022-04-08 04:02:55,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-08 04:02:55,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-08 04:02:55,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {21121#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {21121#true} is VALID [2022-04-08 04:02:55,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {21121#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {21126#(= main_~i~0 0)} is VALID [2022-04-08 04:02:55,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {21126#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21126#(= main_~i~0 0)} is VALID [2022-04-08 04:02:55,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {21126#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:02:55,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:02:55,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:02:55,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:02:55,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:02:55,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:02:55,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:02:55,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:02:55,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:02:55,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:02:55,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:02:55,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:02:55,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:02:55,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:02:55,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:02:55,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:02:55,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:02:55,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:02:55,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-08 04:02:55,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-08 04:02:55,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-08 04:02:55,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21138#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-08 04:02:55,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {21138#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-08 04:02:55,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} assume !(~i~0 < ~n~0); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-08 04:02:55,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} ~i~1 := 0; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:02:55,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:02:55,787 INFO L272 TraceCheckUtils]: 34: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:02:55,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,787 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21121#true} {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:02:55,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:02:55,788 INFO L290 TraceCheckUtils]: 40: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,788 INFO L290 TraceCheckUtils]: 41: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,788 INFO L272 TraceCheckUtils]: 42: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:02:55,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,788 INFO L290 TraceCheckUtils]: 44: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,789 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21121#true} {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} havoc #t~mem5; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,790 INFO L290 TraceCheckUtils]: 48: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:02:55,790 INFO L290 TraceCheckUtils]: 49: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:02:55,790 INFO L272 TraceCheckUtils]: 50: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:02:55,790 INFO L290 TraceCheckUtils]: 51: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,790 INFO L290 TraceCheckUtils]: 52: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,791 INFO L290 TraceCheckUtils]: 53: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,791 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21121#true} {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:02:55,791 INFO L290 TraceCheckUtils]: 55: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:02:55,792 INFO L290 TraceCheckUtils]: 56: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,792 INFO L290 TraceCheckUtils]: 57: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,792 INFO L272 TraceCheckUtils]: 58: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:02:55,792 INFO L290 TraceCheckUtils]: 59: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,792 INFO L290 TraceCheckUtils]: 60: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,793 INFO L290 TraceCheckUtils]: 61: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,793 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {21121#true} {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,793 INFO L290 TraceCheckUtils]: 63: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,794 INFO L290 TraceCheckUtils]: 64: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:55,794 INFO L290 TraceCheckUtils]: 65: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:55,794 INFO L272 TraceCheckUtils]: 66: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:02:55,794 INFO L290 TraceCheckUtils]: 67: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,794 INFO L290 TraceCheckUtils]: 68: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,795 INFO L290 TraceCheckUtils]: 69: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,795 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {21121#true} {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:55,795 INFO L290 TraceCheckUtils]: 71: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:02:55,796 INFO L290 TraceCheckUtils]: 72: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:55,796 INFO L290 TraceCheckUtils]: 73: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:55,796 INFO L272 TraceCheckUtils]: 74: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:02:55,796 INFO L290 TraceCheckUtils]: 75: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,796 INFO L290 TraceCheckUtils]: 76: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,796 INFO L290 TraceCheckUtils]: 77: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,797 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21121#true} {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:55,797 INFO L290 TraceCheckUtils]: 79: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:02:55,798 INFO L290 TraceCheckUtils]: 80: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:55,798 INFO L290 TraceCheckUtils]: 81: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:55,798 INFO L272 TraceCheckUtils]: 82: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:02:55,798 INFO L290 TraceCheckUtils]: 83: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,798 INFO L290 TraceCheckUtils]: 84: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,798 INFO L290 TraceCheckUtils]: 85: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,799 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21121#true} {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:55,799 INFO L290 TraceCheckUtils]: 87: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:02:55,800 INFO L290 TraceCheckUtils]: 88: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,800 INFO L290 TraceCheckUtils]: 89: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,800 INFO L272 TraceCheckUtils]: 90: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:02:55,800 INFO L290 TraceCheckUtils]: 91: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,800 INFO L290 TraceCheckUtils]: 92: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,800 INFO L290 TraceCheckUtils]: 93: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,801 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21121#true} {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,801 INFO L290 TraceCheckUtils]: 95: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,802 INFO L290 TraceCheckUtils]: 96: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:55,802 INFO L290 TraceCheckUtils]: 97: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:55,802 INFO L272 TraceCheckUtils]: 98: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:02:55,802 INFO L290 TraceCheckUtils]: 99: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,802 INFO L290 TraceCheckUtils]: 100: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,802 INFO L290 TraceCheckUtils]: 101: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,803 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {21121#true} {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:55,803 INFO L290 TraceCheckUtils]: 103: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:02:55,804 INFO L290 TraceCheckUtils]: 104: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:55,804 INFO L290 TraceCheckUtils]: 105: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:55,804 INFO L272 TraceCheckUtils]: 106: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:02:55,804 INFO L290 TraceCheckUtils]: 107: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,804 INFO L290 TraceCheckUtils]: 108: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,804 INFO L290 TraceCheckUtils]: 109: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,805 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {21121#true} {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:55,805 INFO L290 TraceCheckUtils]: 111: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:02:55,806 INFO L290 TraceCheckUtils]: 112: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:55,806 INFO L290 TraceCheckUtils]: 113: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:55,806 INFO L272 TraceCheckUtils]: 114: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:02:55,806 INFO L290 TraceCheckUtils]: 115: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:02:55,806 INFO L290 TraceCheckUtils]: 116: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:02:55,806 INFO L290 TraceCheckUtils]: 117: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:02:55,807 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21121#true} {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:55,807 INFO L290 TraceCheckUtils]: 119: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:02:55,808 INFO L290 TraceCheckUtils]: 120: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21195#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:02:55,808 INFO L290 TraceCheckUtils]: 121: Hoare triple {21195#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21196#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:02:55,808 INFO L272 TraceCheckUtils]: 122: Hoare triple {21196#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21197#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:02:55,809 INFO L290 TraceCheckUtils]: 123: Hoare triple {21197#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {21198#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:02:55,809 INFO L290 TraceCheckUtils]: 124: Hoare triple {21198#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {21122#false} is VALID [2022-04-08 04:02:55,809 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-08 04:02:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 22 proven. 386 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 04:02:55,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:02:55,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911797898] [2022-04-08 04:02:55,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911797898] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:02:55,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507249066] [2022-04-08 04:02:55,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:02:55,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:55,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:02:55,811 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-08 04:02:55,811 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-08 04:02:55,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:02:55,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:02:55,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-08 04:02:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:55,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:02:56,110 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-08 04:06:41,771 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 19 treesize of output 7 [2022-04-08 04:06:41,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21121#true} is VALID [2022-04-08 04:06:41,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#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(9, 2); {21121#true} is VALID [2022-04-08 04:06:41,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:06:41,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-08 04:06:41,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-08 04:06:41,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {21121#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {21121#true} is VALID [2022-04-08 04:06:41,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {21121#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {21126#(= main_~i~0 0)} is VALID [2022-04-08 04:06:41,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {21126#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21126#(= main_~i~0 0)} is VALID [2022-04-08 04:06:41,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {21126#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:06:41,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:06:41,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:06:41,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:06:41,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:06:41,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:06:41,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:06:41,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:06:41,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:06:41,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:06:41,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:06:41,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:06:41,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:06:41,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:06:41,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:06:41,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:06:41,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:06:41,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:06:41,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-08 04:06:41,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-08 04:06:41,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-08 04:06:41,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-08 04:06:41,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-08 04:06:41,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} assume !(~i~0 < ~n~0); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-08 04:06:41,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} ~i~1 := 0; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,847 INFO L272 TraceCheckUtils]: 34: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,848 INFO L290 TraceCheckUtils]: 37: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,848 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,850 INFO L272 TraceCheckUtils]: 42: Hoare triple {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,850 INFO L290 TraceCheckUtils]: 43: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,851 INFO L290 TraceCheckUtils]: 45: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,851 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,852 INFO L290 TraceCheckUtils]: 47: Hoare triple {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,852 INFO L290 TraceCheckUtils]: 49: Hoare triple {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,853 INFO L272 TraceCheckUtils]: 50: Hoare triple {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,853 INFO L290 TraceCheckUtils]: 51: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,854 INFO L290 TraceCheckUtils]: 53: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,854 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,856 INFO L272 TraceCheckUtils]: 58: Hoare triple {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,856 INFO L290 TraceCheckUtils]: 59: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,857 INFO L290 TraceCheckUtils]: 60: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,857 INFO L290 TraceCheckUtils]: 61: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,857 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,858 INFO L290 TraceCheckUtils]: 63: Hoare triple {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,858 INFO L290 TraceCheckUtils]: 64: Hoare triple {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,858 INFO L290 TraceCheckUtils]: 65: Hoare triple {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,859 INFO L272 TraceCheckUtils]: 66: Hoare triple {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,859 INFO L290 TraceCheckUtils]: 67: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,860 INFO L290 TraceCheckUtils]: 68: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,860 INFO L290 TraceCheckUtils]: 69: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,860 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,861 INFO L290 TraceCheckUtils]: 71: Hoare triple {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,861 INFO L290 TraceCheckUtils]: 72: Hoare triple {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,862 INFO L290 TraceCheckUtils]: 73: Hoare triple {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,862 INFO L272 TraceCheckUtils]: 74: Hoare triple {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,863 INFO L290 TraceCheckUtils]: 75: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,863 INFO L290 TraceCheckUtils]: 76: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,863 INFO L290 TraceCheckUtils]: 77: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,864 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,864 INFO L290 TraceCheckUtils]: 79: Hoare triple {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,864 INFO L290 TraceCheckUtils]: 80: Hoare triple {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,865 INFO L290 TraceCheckUtils]: 81: Hoare triple {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,865 INFO L272 TraceCheckUtils]: 82: Hoare triple {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,866 INFO L290 TraceCheckUtils]: 83: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,866 INFO L290 TraceCheckUtils]: 84: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,866 INFO L290 TraceCheckUtils]: 85: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,867 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,867 INFO L290 TraceCheckUtils]: 87: Hoare triple {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,867 INFO L290 TraceCheckUtils]: 88: Hoare triple {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,868 INFO L290 TraceCheckUtils]: 89: Hoare triple {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,868 INFO L272 TraceCheckUtils]: 90: Hoare triple {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,869 INFO L290 TraceCheckUtils]: 91: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,869 INFO L290 TraceCheckUtils]: 92: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,869 INFO L290 TraceCheckUtils]: 93: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,870 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,870 INFO L290 TraceCheckUtils]: 95: Hoare triple {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,870 INFO L290 TraceCheckUtils]: 96: Hoare triple {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,871 INFO L290 TraceCheckUtils]: 97: Hoare triple {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,871 INFO L272 TraceCheckUtils]: 98: Hoare triple {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,872 INFO L290 TraceCheckUtils]: 99: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,872 INFO L290 TraceCheckUtils]: 100: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,872 INFO L290 TraceCheckUtils]: 101: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,873 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,873 INFO L290 TraceCheckUtils]: 103: Hoare triple {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,873 INFO L290 TraceCheckUtils]: 104: Hoare triple {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} is VALID [2022-04-08 04:06:41,874 INFO L290 TraceCheckUtils]: 105: Hoare triple {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} is VALID [2022-04-08 04:06:41,874 INFO L272 TraceCheckUtils]: 106: Hoare triple {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,875 INFO L290 TraceCheckUtils]: 107: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,875 INFO L290 TraceCheckUtils]: 108: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,875 INFO L290 TraceCheckUtils]: 109: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,876 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} #68#return; {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} is VALID [2022-04-08 04:06:41,876 INFO L290 TraceCheckUtils]: 111: Hoare triple {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} havoc #t~mem5; {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} is VALID [2022-04-08 04:06:41,876 INFO L290 TraceCheckUtils]: 112: Hoare triple {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,877 INFO L290 TraceCheckUtils]: 113: Hoare triple {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,878 INFO L272 TraceCheckUtils]: 114: Hoare triple {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,878 INFO L290 TraceCheckUtils]: 115: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,878 INFO L290 TraceCheckUtils]: 116: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,878 INFO L290 TraceCheckUtils]: 117: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-08 04:06:41,879 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,879 INFO L290 TraceCheckUtils]: 119: Hoare triple {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,880 INFO L290 TraceCheckUtils]: 120: Hoare triple {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21574#(and (= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-08 04:06:41,880 INFO L290 TraceCheckUtils]: 121: Hoare triple {21574#(and (= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21196#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:06:41,880 INFO L272 TraceCheckUtils]: 122: Hoare triple {21196#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21581#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:06:41,881 INFO L290 TraceCheckUtils]: 123: Hoare triple {21581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:06:41,881 INFO L290 TraceCheckUtils]: 124: Hoare triple {21585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21122#false} is VALID [2022-04-08 04:06:41,881 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-08 04:06:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 04:06:41,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:06:44,242 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 14 [2022-04-08 04:06:44,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-08 04:06:44,424 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-08 04:06:44,425 INFO L290 TraceCheckUtils]: 124: Hoare triple {21585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21122#false} is VALID [2022-04-08 04:06:44,425 INFO L290 TraceCheckUtils]: 123: Hoare triple {21581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:06:44,426 INFO L272 TraceCheckUtils]: 122: Hoare triple {21196#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21581#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:06:44,426 INFO L290 TraceCheckUtils]: 121: Hoare triple {21195#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21196#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:06:44,427 INFO L290 TraceCheckUtils]: 120: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21195#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,427 INFO L290 TraceCheckUtils]: 119: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:06:44,428 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21121#true} {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:06:44,428 INFO L290 TraceCheckUtils]: 117: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:06:44,428 INFO L290 TraceCheckUtils]: 116: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:06:44,428 INFO L290 TraceCheckUtils]: 115: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:06:44,428 INFO L272 TraceCheckUtils]: 114: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:06:44,428 INFO L290 TraceCheckUtils]: 113: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:06:44,429 INFO L290 TraceCheckUtils]: 112: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:06:44,429 INFO L290 TraceCheckUtils]: 111: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:06:44,430 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {21121#true} {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:06:44,430 INFO L290 TraceCheckUtils]: 109: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:06:44,430 INFO L290 TraceCheckUtils]: 108: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:06:44,430 INFO L290 TraceCheckUtils]: 107: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:06:44,430 INFO L272 TraceCheckUtils]: 106: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:06:44,430 INFO L290 TraceCheckUtils]: 105: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:06:44,431 INFO L290 TraceCheckUtils]: 104: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:06:44,431 INFO L290 TraceCheckUtils]: 103: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:06:44,432 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {21121#true} {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:06:44,432 INFO L290 TraceCheckUtils]: 101: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:06:44,432 INFO L290 TraceCheckUtils]: 100: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:06:44,432 INFO L290 TraceCheckUtils]: 99: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:06:44,432 INFO L272 TraceCheckUtils]: 98: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:06:44,433 INFO L290 TraceCheckUtils]: 97: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:06:44,433 INFO L290 TraceCheckUtils]: 96: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:06:44,434 INFO L290 TraceCheckUtils]: 95: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,434 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21121#true} {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,434 INFO L290 TraceCheckUtils]: 93: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:06:44,434 INFO L290 TraceCheckUtils]: 92: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:06:44,434 INFO L290 TraceCheckUtils]: 91: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:06:44,434 INFO L272 TraceCheckUtils]: 90: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:06:44,435 INFO L290 TraceCheckUtils]: 89: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,435 INFO L290 TraceCheckUtils]: 88: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,436 INFO L290 TraceCheckUtils]: 87: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:06:44,436 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21121#true} {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:06:44,436 INFO L290 TraceCheckUtils]: 85: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:06:44,437 INFO L290 TraceCheckUtils]: 84: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:06:44,437 INFO L290 TraceCheckUtils]: 83: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:06:44,437 INFO L272 TraceCheckUtils]: 82: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:06:44,437 INFO L290 TraceCheckUtils]: 81: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:06:44,438 INFO L290 TraceCheckUtils]: 80: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:06:44,438 INFO L290 TraceCheckUtils]: 79: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:06:44,438 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21121#true} {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:06:44,438 INFO L290 TraceCheckUtils]: 77: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:06:44,439 INFO L290 TraceCheckUtils]: 76: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:06:44,439 INFO L290 TraceCheckUtils]: 75: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:06:44,439 INFO L272 TraceCheckUtils]: 74: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:06:44,439 INFO L290 TraceCheckUtils]: 73: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:06:44,440 INFO L290 TraceCheckUtils]: 72: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:06:44,440 INFO L290 TraceCheckUtils]: 71: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:06:44,440 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {21121#true} {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:06:44,441 INFO L290 TraceCheckUtils]: 69: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:06:44,441 INFO L290 TraceCheckUtils]: 68: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:06:44,441 INFO L290 TraceCheckUtils]: 67: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:06:44,441 INFO L272 TraceCheckUtils]: 66: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:06:44,441 INFO L290 TraceCheckUtils]: 65: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:06:44,442 INFO L290 TraceCheckUtils]: 64: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:06:44,442 INFO L290 TraceCheckUtils]: 63: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,443 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {21121#true} {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,443 INFO L290 TraceCheckUtils]: 61: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:06:44,443 INFO L290 TraceCheckUtils]: 60: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:06:44,443 INFO L290 TraceCheckUtils]: 59: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:06:44,443 INFO L272 TraceCheckUtils]: 58: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:06:44,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,444 INFO L290 TraceCheckUtils]: 56: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:06:44,445 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21121#true} {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:06:44,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:06:44,445 INFO L290 TraceCheckUtils]: 52: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:06:44,445 INFO L290 TraceCheckUtils]: 51: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:06:44,445 INFO L272 TraceCheckUtils]: 50: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:06:44,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:06:44,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:06:44,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} havoc #t~mem5; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,447 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21121#true} {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,447 INFO L290 TraceCheckUtils]: 45: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:06:44,447 INFO L290 TraceCheckUtils]: 44: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:06:44,447 INFO L290 TraceCheckUtils]: 43: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:06:44,447 INFO L272 TraceCheckUtils]: 42: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:06:44,447 INFO L290 TraceCheckUtils]: 41: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} havoc #t~mem5; {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,449 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21121#true} {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:06:44,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-08 04:06:44,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-08 04:06:44,449 INFO L272 TraceCheckUtils]: 34: Hoare triple {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-08 04:06:44,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} ~i~1 := 0; {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:06:44,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} assume !(~i~0 < ~n~0); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-08 04:06:44,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-08 04:06:44,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-08 04:06:44,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-08 04:06:44,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-08 04:06:44,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-08 04:06:44,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:06:44,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:06:44,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:06:44,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:06:44,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:06:44,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:06:44,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:06:44,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:06:44,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:06:44,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:06:44,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:06:44,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:06:44,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:06:44,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:06:44,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:06:44,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:06:44,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:06:44,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {21126#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:06:44,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {21126#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21126#(= main_~i~0 0)} is VALID [2022-04-08 04:06:44,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {21121#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {21126#(= main_~i~0 0)} is VALID [2022-04-08 04:06:44,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {21121#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {21121#true} is VALID [2022-04-08 04:06:44,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-08 04:06:44,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-08 04:06:44,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-08 04:06:44,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#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(9, 2); {21121#true} is VALID [2022-04-08 04:06:44,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21121#true} is VALID [2022-04-08 04:06:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 22 proven. 386 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 04:06:44,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507249066] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:06:44,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 04:06:44,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 30] total 47 [2022-04-08 04:06:44,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:06:44,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [535135718] [2022-04-08 04:06:44,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [535135718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:06:44,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:06:44,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-08 04:06:44,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414831710] [2022-04-08 04:06:44,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:06:44,463 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 126 [2022-04-08 04:06:44,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:06:44,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:06:44,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:06:44,533 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-08 04:06:44,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:06:44,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-08 04:06:44,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2017, Unknown=12, NotChecked=0, Total=2162 [2022-04-08 04:06:44,534 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:06:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:06:49,337 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-04-08 04:06:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 04:06:49,337 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 126 [2022-04-08 04:06:49,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:06:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:06:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2022-04-08 04:06:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:06:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2022-04-08 04:06:49,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 110 transitions. [2022-04-08 04:06:49,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:06:49,441 INFO L225 Difference]: With dead ends: 142 [2022-04-08 04:06:49,441 INFO L226 Difference]: Without dead ends: 140 [2022-04-08 04:06:49,442 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 235 SyntacticMatches, 26 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 227.3s TimeCoverageRelationStatistics Valid=304, Invalid=5536, Unknown=12, NotChecked=0, Total=5852 [2022-04-08 04:06:49,442 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 85 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2783 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:06:49,443 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 172 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2783 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 04:06:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-08 04:06:49,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2022-04-08 04:06:49,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:06:49,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:06:49,523 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:06:49,523 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:06:49,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:06:49,525 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-08 04:06:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-08 04:06:49,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:06:49,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:06:49,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 140 states. [2022-04-08 04:06:49,525 INFO L87 Difference]: Start difference. First operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 140 states. [2022-04-08 04:06:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:06:49,527 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-08 04:06:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-08 04:06:49,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:06:49,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:06:49,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:06:49,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:06:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:06:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2022-04-08 04:06:49,529 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 126 [2022-04-08 04:06:49,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:06:49,529 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2022-04-08 04:06:49,530 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:06:49,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 138 transitions. [2022-04-08 04:06:49,775 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-08 04:06:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-08 04:06:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-08 04:06:49,776 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:06:49,776 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:06:49,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 04:06:49,977 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:06:49,977 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:06:49,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:06:49,977 INFO L85 PathProgramCache]: Analyzing trace with hash 886065326, now seen corresponding path program 45 times [2022-04-08 04:06:49,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:06:49,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1835608226] [2022-04-08 04:06:49,979 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:06:49,979 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:06:49,979 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:06:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash 886065326, now seen corresponding path program 46 times [2022-04-08 04:06:49,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:06:49,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603115866] [2022-04-08 04:06:49,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:06:49,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:06:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:06:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {22948#(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(9, 2); {22868#true} is VALID [2022-04-08 04:06:50,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,262 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-08 04:06:50,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-08 04:06:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} #68#return; {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-08 04:06:50,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-08 04:06:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22892#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:06:50,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-08 04:06:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22897#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:06:50,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-08 04:06:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22902#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:06:50,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-08 04:06:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22907#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:06:50,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-08 04:06:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22912#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:06:50,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-08 04:06:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22917#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:06:50,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-08 04:06:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22922#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:06:50,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-08 04:06:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22927#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:06:50,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-08 04:06:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22932#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:06:50,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-04-08 04:06:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22937#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:06:50,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-08 04:06:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22942#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:06:50,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {22868#true} call ULTIMATE.init(); {22948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:06:50,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {22948#(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(9, 2); {22868#true} is VALID [2022-04-08 04:06:50,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-08 04:06:50,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-08 04:06:50,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {22868#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {22868#true} is VALID [2022-04-08 04:06:50,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {22868#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {22873#(= main_~i~0 0)} is VALID [2022-04-08 04:06:50,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {22873#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22873#(= main_~i~0 0)} is VALID [2022-04-08 04:06:50,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {22873#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22874#(<= main_~i~0 1)} is VALID [2022-04-08 04:06:50,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {22874#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22874#(<= main_~i~0 1)} is VALID [2022-04-08 04:06:50,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {22874#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22875#(<= main_~i~0 2)} is VALID [2022-04-08 04:06:50,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {22875#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22875#(<= main_~i~0 2)} is VALID [2022-04-08 04:06:50,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {22875#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22876#(<= main_~i~0 3)} is VALID [2022-04-08 04:06:50,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {22876#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22876#(<= main_~i~0 3)} is VALID [2022-04-08 04:06:50,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {22876#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22877#(<= main_~i~0 4)} is VALID [2022-04-08 04:06:50,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {22877#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22877#(<= main_~i~0 4)} is VALID [2022-04-08 04:06:50,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {22877#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22878#(<= main_~i~0 5)} is VALID [2022-04-08 04:06:50,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {22878#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22878#(<= main_~i~0 5)} is VALID [2022-04-08 04:06:50,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {22878#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22879#(<= main_~i~0 6)} is VALID [2022-04-08 04:06:50,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {22879#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22879#(<= main_~i~0 6)} is VALID [2022-04-08 04:06:50,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {22879#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22880#(<= main_~i~0 7)} is VALID [2022-04-08 04:06:50,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {22880#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22880#(<= main_~i~0 7)} is VALID [2022-04-08 04:06:50,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {22880#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22881#(<= main_~i~0 8)} is VALID [2022-04-08 04:06:50,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {22881#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22881#(<= main_~i~0 8)} is VALID [2022-04-08 04:06:50,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {22881#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22882#(<= main_~i~0 9)} is VALID [2022-04-08 04:06:50,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {22882#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22882#(<= main_~i~0 9)} is VALID [2022-04-08 04:06:50,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {22882#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22883#(<= main_~i~0 10)} is VALID [2022-04-08 04:06:50,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {22883#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22883#(<= main_~i~0 10)} is VALID [2022-04-08 04:06:50,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {22883#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22884#(<= main_~i~0 11)} is VALID [2022-04-08 04:06:50,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {22884#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22884#(<= main_~i~0 11)} is VALID [2022-04-08 04:06:50,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {22884#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22885#(<= main_~i~0 12)} is VALID [2022-04-08 04:06:50,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {22885#(<= main_~i~0 12)} assume !(~i~0 < ~n~0); {22886#(<= main_~n~0 12)} is VALID [2022-04-08 04:06:50,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {22886#(<= main_~n~0 12)} ~i~1 := 0; {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-08 04:06:50,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-08 04:06:50,318 INFO L272 TraceCheckUtils]: 34: Hoare triple {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:50,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,319 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22868#true} {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} #68#return; {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-08 04:06:50,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} havoc #t~mem5; {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-08 04:06:50,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:06:50,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:06:50,320 INFO L272 TraceCheckUtils]: 42: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:50,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,320 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22868#true} {22892#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:06:50,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:06:50,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:06:50,321 INFO L290 TraceCheckUtils]: 49: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:06:50,321 INFO L272 TraceCheckUtils]: 50: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:50,321 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,321 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,322 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22868#true} {22897#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:06:50,322 INFO L290 TraceCheckUtils]: 55: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:06:50,322 INFO L290 TraceCheckUtils]: 56: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:06:50,323 INFO L290 TraceCheckUtils]: 57: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:06:50,323 INFO L272 TraceCheckUtils]: 58: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:50,323 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,323 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,324 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {22868#true} {22902#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:06:50,324 INFO L290 TraceCheckUtils]: 63: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:06:50,324 INFO L290 TraceCheckUtils]: 64: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:06:50,324 INFO L290 TraceCheckUtils]: 65: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:06:50,325 INFO L272 TraceCheckUtils]: 66: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:50,325 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,325 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,325 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,325 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {22868#true} {22907#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:06:50,325 INFO L290 TraceCheckUtils]: 71: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:06:50,326 INFO L290 TraceCheckUtils]: 72: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:06:50,326 INFO L290 TraceCheckUtils]: 73: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:06:50,326 INFO L272 TraceCheckUtils]: 74: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:50,326 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,326 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,326 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,327 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {22868#true} {22912#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:06:50,327 INFO L290 TraceCheckUtils]: 79: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:06:50,327 INFO L290 TraceCheckUtils]: 80: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:06:50,328 INFO L290 TraceCheckUtils]: 81: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:06:50,328 INFO L272 TraceCheckUtils]: 82: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:50,328 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,328 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,328 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,328 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {22868#true} {22917#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:06:50,329 INFO L290 TraceCheckUtils]: 87: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:06:50,329 INFO L290 TraceCheckUtils]: 88: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:06:50,329 INFO L290 TraceCheckUtils]: 89: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:06:50,329 INFO L272 TraceCheckUtils]: 90: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:50,330 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,330 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,330 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,330 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22868#true} {22922#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:06:50,330 INFO L290 TraceCheckUtils]: 95: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:06:50,331 INFO L290 TraceCheckUtils]: 96: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:06:50,331 INFO L290 TraceCheckUtils]: 97: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:06:50,331 INFO L272 TraceCheckUtils]: 98: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:50,331 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,331 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,331 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,332 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {22868#true} {22927#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:06:50,332 INFO L290 TraceCheckUtils]: 103: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:06:50,332 INFO L290 TraceCheckUtils]: 104: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:06:50,333 INFO L290 TraceCheckUtils]: 105: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:06:50,333 INFO L272 TraceCheckUtils]: 106: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:50,333 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,333 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,333 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,333 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {22868#true} {22932#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:06:50,334 INFO L290 TraceCheckUtils]: 111: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:06:50,334 INFO L290 TraceCheckUtils]: 112: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:06:50,334 INFO L290 TraceCheckUtils]: 113: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:06:50,334 INFO L272 TraceCheckUtils]: 114: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:50,335 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,335 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,335 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,335 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {22868#true} {22937#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:06:50,335 INFO L290 TraceCheckUtils]: 119: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:06:50,336 INFO L290 TraceCheckUtils]: 120: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:06:50,336 INFO L290 TraceCheckUtils]: 121: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:06:50,336 INFO L272 TraceCheckUtils]: 122: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:50,336 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:50,336 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:50,336 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:50,337 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {22868#true} {22942#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:06:50,337 INFO L290 TraceCheckUtils]: 127: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:06:50,337 INFO L290 TraceCheckUtils]: 128: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22947#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:06:50,338 INFO L290 TraceCheckUtils]: 129: Hoare triple {22947#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22869#false} is VALID [2022-04-08 04:06:50,338 INFO L272 TraceCheckUtils]: 130: Hoare triple {22869#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22869#false} is VALID [2022-04-08 04:06:50,338 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-08 04:06:50,338 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-08 04:06:50,338 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-08 04:06:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 267 proven. 189 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 04:06:50,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:06:50,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603115866] [2022-04-08 04:06:50,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603115866] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:06:50,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303716001] [2022-04-08 04:06:50,339 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:06:50,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:06:50,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:06:50,340 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-08 04:06:50,343 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-08 04:06:50,755 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:06:50,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:06:50,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 04:06:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:50,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:06:51,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {22868#true} call ULTIMATE.init(); {22868#true} is VALID [2022-04-08 04:06:51,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#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(9, 2); {22868#true} is VALID [2022-04-08 04:06:51,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:51,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-08 04:06:51,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-08 04:06:51,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {22868#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {22868#true} is VALID [2022-04-08 04:06:51,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {22868#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {22970#(<= main_~i~0 0)} is VALID [2022-04-08 04:06:51,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {22970#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22970#(<= main_~i~0 0)} is VALID [2022-04-08 04:06:51,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {22970#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22874#(<= main_~i~0 1)} is VALID [2022-04-08 04:06:51,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {22874#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22874#(<= main_~i~0 1)} is VALID [2022-04-08 04:06:51,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {22874#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22875#(<= main_~i~0 2)} is VALID [2022-04-08 04:06:51,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {22875#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22875#(<= main_~i~0 2)} is VALID [2022-04-08 04:06:51,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {22875#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22876#(<= main_~i~0 3)} is VALID [2022-04-08 04:06:51,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {22876#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22876#(<= main_~i~0 3)} is VALID [2022-04-08 04:06:51,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {22876#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22877#(<= main_~i~0 4)} is VALID [2022-04-08 04:06:51,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {22877#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22877#(<= main_~i~0 4)} is VALID [2022-04-08 04:06:51,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {22877#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22878#(<= main_~i~0 5)} is VALID [2022-04-08 04:06:51,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {22878#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22878#(<= main_~i~0 5)} is VALID [2022-04-08 04:06:51,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {22878#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22879#(<= main_~i~0 6)} is VALID [2022-04-08 04:06:51,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {22879#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22879#(<= main_~i~0 6)} is VALID [2022-04-08 04:06:51,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {22879#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22880#(<= main_~i~0 7)} is VALID [2022-04-08 04:06:51,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {22880#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22880#(<= main_~i~0 7)} is VALID [2022-04-08 04:06:51,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {22880#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22881#(<= main_~i~0 8)} is VALID [2022-04-08 04:06:51,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {22881#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22881#(<= main_~i~0 8)} is VALID [2022-04-08 04:06:51,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {22881#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22882#(<= main_~i~0 9)} is VALID [2022-04-08 04:06:51,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {22882#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22882#(<= main_~i~0 9)} is VALID [2022-04-08 04:06:51,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {22882#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22883#(<= main_~i~0 10)} is VALID [2022-04-08 04:06:51,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {22883#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22883#(<= main_~i~0 10)} is VALID [2022-04-08 04:06:51,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {22883#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22884#(<= main_~i~0 11)} is VALID [2022-04-08 04:06:51,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {22884#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22884#(<= main_~i~0 11)} is VALID [2022-04-08 04:06:51,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {22884#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22885#(<= main_~i~0 12)} is VALID [2022-04-08 04:06:51,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {22885#(<= main_~i~0 12)} assume !(~i~0 < ~n~0); {22886#(<= main_~n~0 12)} is VALID [2022-04-08 04:06:51,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {22886#(<= main_~n~0 12)} ~i~1 := 0; {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,714 INFO L272 TraceCheckUtils]: 34: Hoare triple {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:51,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:51,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:51,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:51,714 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22868#true} {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} #68#return; {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,715 INFO L290 TraceCheckUtils]: 39: Hoare triple {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,715 INFO L272 TraceCheckUtils]: 42: Hoare triple {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:51,716 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:51,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:51,716 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:51,716 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22868#true} {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} #68#return; {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,716 INFO L290 TraceCheckUtils]: 47: Hoare triple {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,717 INFO L272 TraceCheckUtils]: 50: Hoare triple {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:51,717 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:51,717 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:51,717 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:51,718 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22868#true} {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} #68#return; {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,718 INFO L290 TraceCheckUtils]: 55: Hoare triple {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} is VALID [2022-04-08 04:06:51,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} is VALID [2022-04-08 04:06:51,719 INFO L272 TraceCheckUtils]: 58: Hoare triple {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:51,719 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:51,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:51,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:51,720 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {22868#true} {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} #68#return; {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} is VALID [2022-04-08 04:06:51,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} havoc #t~mem5; {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} is VALID [2022-04-08 04:06:51,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,721 INFO L290 TraceCheckUtils]: 65: Hoare triple {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,721 INFO L272 TraceCheckUtils]: 66: Hoare triple {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:51,721 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:51,721 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:51,721 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:51,721 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {22868#true} {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} #68#return; {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,722 INFO L290 TraceCheckUtils]: 71: Hoare triple {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,722 INFO L290 TraceCheckUtils]: 72: Hoare triple {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,722 INFO L290 TraceCheckUtils]: 73: Hoare triple {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,722 INFO L272 TraceCheckUtils]: 74: Hoare triple {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:51,723 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:51,723 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:51,723 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:51,723 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {22868#true} {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} #68#return; {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,723 INFO L290 TraceCheckUtils]: 79: Hoare triple {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,724 INFO L290 TraceCheckUtils]: 80: Hoare triple {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,724 INFO L290 TraceCheckUtils]: 81: Hoare triple {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,724 INFO L272 TraceCheckUtils]: 82: Hoare triple {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:51,724 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:51,724 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:51,724 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:51,725 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {22868#true} {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} #68#return; {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,725 INFO L290 TraceCheckUtils]: 87: Hoare triple {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,725 INFO L290 TraceCheckUtils]: 88: Hoare triple {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,726 INFO L290 TraceCheckUtils]: 89: Hoare triple {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,726 INFO L272 TraceCheckUtils]: 90: Hoare triple {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:51,726 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:51,726 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:51,726 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:51,726 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22868#true} {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} #68#return; {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,727 INFO L290 TraceCheckUtils]: 95: Hoare triple {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,727 INFO L290 TraceCheckUtils]: 96: Hoare triple {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,728 INFO L290 TraceCheckUtils]: 97: Hoare triple {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,728 INFO L272 TraceCheckUtils]: 98: Hoare triple {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:51,728 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:51,728 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:51,728 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:51,728 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {22868#true} {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} #68#return; {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,728 INFO L290 TraceCheckUtils]: 103: Hoare triple {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,729 INFO L290 TraceCheckUtils]: 104: Hoare triple {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,729 INFO L290 TraceCheckUtils]: 105: Hoare triple {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,729 INFO L272 TraceCheckUtils]: 106: Hoare triple {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:51,729 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:51,729 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:51,730 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:51,730 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {22868#true} {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} #68#return; {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,730 INFO L290 TraceCheckUtils]: 111: Hoare triple {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,731 INFO L290 TraceCheckUtils]: 112: Hoare triple {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,731 INFO L290 TraceCheckUtils]: 113: Hoare triple {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,731 INFO L272 TraceCheckUtils]: 114: Hoare triple {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:51,731 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:51,731 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:51,731 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:51,732 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {22868#true} {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} #68#return; {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,732 INFO L290 TraceCheckUtils]: 119: Hoare triple {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,732 INFO L290 TraceCheckUtils]: 120: Hoare triple {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,733 INFO L290 TraceCheckUtils]: 121: Hoare triple {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,733 INFO L272 TraceCheckUtils]: 122: Hoare triple {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:51,733 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:51,733 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:51,733 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:51,733 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {22868#true} {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} #68#return; {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,734 INFO L290 TraceCheckUtils]: 127: Hoare triple {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-08 04:06:51,734 INFO L290 TraceCheckUtils]: 128: Hoare triple {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23349#(and (<= main_~n~0 12) (<= 12 main_~i~1))} is VALID [2022-04-08 04:06:51,734 INFO L290 TraceCheckUtils]: 129: Hoare triple {23349#(and (<= main_~n~0 12) (<= 12 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22869#false} is VALID [2022-04-08 04:06:51,735 INFO L272 TraceCheckUtils]: 130: Hoare triple {22869#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22869#false} is VALID [2022-04-08 04:06:51,735 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-08 04:06:51,735 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-08 04:06:51,735 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-08 04:06:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 312 proven. 144 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 04:06:51,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:06:52,321 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-08 04:06:52,321 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-08 04:06:52,321 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-08 04:06:52,321 INFO L272 TraceCheckUtils]: 130: Hoare triple {22869#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22869#false} is VALID [2022-04-08 04:06:52,322 INFO L290 TraceCheckUtils]: 129: Hoare triple {22947#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22869#false} is VALID [2022-04-08 04:06:52,322 INFO L290 TraceCheckUtils]: 128: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22947#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:06:52,322 INFO L290 TraceCheckUtils]: 127: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:06:52,323 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {22868#true} {22942#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:06:52,323 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:52,323 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:52,323 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:52,323 INFO L272 TraceCheckUtils]: 122: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:52,323 INFO L290 TraceCheckUtils]: 121: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:06:52,324 INFO L290 TraceCheckUtils]: 120: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:06:52,324 INFO L290 TraceCheckUtils]: 119: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:06:52,325 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {22868#true} {22937#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:06:52,325 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:52,325 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:52,325 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:52,325 INFO L272 TraceCheckUtils]: 114: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:52,325 INFO L290 TraceCheckUtils]: 113: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:06:52,326 INFO L290 TraceCheckUtils]: 112: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:06:52,326 INFO L290 TraceCheckUtils]: 111: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:06:52,326 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {22868#true} {22932#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:06:52,327 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:52,327 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:52,327 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:52,327 INFO L272 TraceCheckUtils]: 106: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:52,327 INFO L290 TraceCheckUtils]: 105: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:06:52,328 INFO L290 TraceCheckUtils]: 104: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:06:52,328 INFO L290 TraceCheckUtils]: 103: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:06:52,328 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {22868#true} {22927#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:06:52,328 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:52,329 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:52,329 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:52,329 INFO L272 TraceCheckUtils]: 98: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:52,330 INFO L290 TraceCheckUtils]: 97: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:06:52,330 INFO L290 TraceCheckUtils]: 96: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:06:52,330 INFO L290 TraceCheckUtils]: 95: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:06:52,331 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22868#true} {22922#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:06:52,331 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:52,331 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:52,331 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:52,331 INFO L272 TraceCheckUtils]: 90: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:52,331 INFO L290 TraceCheckUtils]: 89: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:06:52,332 INFO L290 TraceCheckUtils]: 88: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:06:52,332 INFO L290 TraceCheckUtils]: 87: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:06:52,338 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {22868#true} {22917#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:06:52,339 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:52,339 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:52,339 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:52,339 INFO L272 TraceCheckUtils]: 82: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:52,339 INFO L290 TraceCheckUtils]: 81: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:06:52,346 INFO L290 TraceCheckUtils]: 80: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:06:52,347 INFO L290 TraceCheckUtils]: 79: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:06:52,348 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {22868#true} {22912#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:06:52,348 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:52,348 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:52,348 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:52,348 INFO L272 TraceCheckUtils]: 74: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:52,348 INFO L290 TraceCheckUtils]: 73: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:06:52,349 INFO L290 TraceCheckUtils]: 72: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:06:52,349 INFO L290 TraceCheckUtils]: 71: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:06:52,349 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {22868#true} {22907#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:06:52,350 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:52,350 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:52,350 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:52,350 INFO L272 TraceCheckUtils]: 66: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:52,350 INFO L290 TraceCheckUtils]: 65: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:06:52,350 INFO L290 TraceCheckUtils]: 64: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:06:52,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:06:52,351 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {22868#true} {22902#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:06:52,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:52,351 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:52,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:52,351 INFO L272 TraceCheckUtils]: 58: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:52,352 INFO L290 TraceCheckUtils]: 57: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:06:52,352 INFO L290 TraceCheckUtils]: 56: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:06:52,353 INFO L290 TraceCheckUtils]: 55: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:06:52,353 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22868#true} {22897#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:06:52,353 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:52,353 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:52,353 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:52,353 INFO L272 TraceCheckUtils]: 50: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:52,354 INFO L290 TraceCheckUtils]: 49: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:06:52,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:06:52,355 INFO L290 TraceCheckUtils]: 47: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:06:52,355 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22868#true} {22892#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:06:52,355 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:52,355 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:52,355 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:52,355 INFO L272 TraceCheckUtils]: 42: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:52,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:06:52,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {23644#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:06:52,356 INFO L290 TraceCheckUtils]: 39: Hoare triple {23644#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {23644#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:06:52,357 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22868#true} {23644#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {23644#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:06:52,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:52,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-08 04:06:52,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-08 04:06:52,357 INFO L272 TraceCheckUtils]: 34: Hoare triple {23644#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-08 04:06:52,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {23644#(<= main_~n~0 (+ main_~i~1 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23644#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:06:52,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {22886#(<= main_~n~0 12)} ~i~1 := 0; {23644#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:06:52,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {22885#(<= main_~i~0 12)} assume !(~i~0 < ~n~0); {22886#(<= main_~n~0 12)} is VALID [2022-04-08 04:06:52,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {22884#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22885#(<= main_~i~0 12)} is VALID [2022-04-08 04:06:52,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {22884#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22884#(<= main_~i~0 11)} is VALID [2022-04-08 04:06:52,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {22883#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22884#(<= main_~i~0 11)} is VALID [2022-04-08 04:06:52,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {22883#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22883#(<= main_~i~0 10)} is VALID [2022-04-08 04:06:52,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {22882#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22883#(<= main_~i~0 10)} is VALID [2022-04-08 04:06:52,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {22882#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22882#(<= main_~i~0 9)} is VALID [2022-04-08 04:06:52,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {22881#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22882#(<= main_~i~0 9)} is VALID [2022-04-08 04:06:52,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {22881#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22881#(<= main_~i~0 8)} is VALID [2022-04-08 04:06:52,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {22880#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22881#(<= main_~i~0 8)} is VALID [2022-04-08 04:06:52,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {22880#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22880#(<= main_~i~0 7)} is VALID [2022-04-08 04:06:52,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {22879#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22880#(<= main_~i~0 7)} is VALID [2022-04-08 04:06:52,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {22879#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22879#(<= main_~i~0 6)} is VALID [2022-04-08 04:06:52,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {22878#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22879#(<= main_~i~0 6)} is VALID [2022-04-08 04:06:52,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {22878#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22878#(<= main_~i~0 5)} is VALID [2022-04-08 04:06:52,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {22877#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22878#(<= main_~i~0 5)} is VALID [2022-04-08 04:06:52,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {22877#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22877#(<= main_~i~0 4)} is VALID [2022-04-08 04:06:52,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {22876#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22877#(<= main_~i~0 4)} is VALID [2022-04-08 04:06:52,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {22876#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22876#(<= main_~i~0 3)} is VALID [2022-04-08 04:06:52,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {22875#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22876#(<= main_~i~0 3)} is VALID [2022-04-08 04:06:52,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {22875#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22875#(<= main_~i~0 2)} is VALID [2022-04-08 04:06:52,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {22874#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22875#(<= main_~i~0 2)} is VALID [2022-04-08 04:06:52,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {22874#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22874#(<= main_~i~0 1)} is VALID [2022-04-08 04:06:52,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {22970#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22874#(<= main_~i~0 1)} is VALID [2022-04-08 04:06:52,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {22970#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22970#(<= main_~i~0 0)} is VALID [2022-04-08 04:06:52,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {22868#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {22970#(<= main_~i~0 0)} is VALID [2022-04-08 04:06:52,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {22868#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {22868#true} is VALID [2022-04-08 04:06:52,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-08 04:06:52,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-08 04:06:52,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-08 04:06:52,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#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(9, 2); {22868#true} is VALID [2022-04-08 04:06:52,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {22868#true} call ULTIMATE.init(); {22868#true} is VALID [2022-04-08 04:06:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 312 proven. 144 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 04:06:52,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303716001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:06:52,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 04:06:52,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 45 [2022-04-08 04:06:52,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:06:52,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1835608226] [2022-04-08 04:06:52,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1835608226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:06:52,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:06:52,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-08 04:06:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578544930] [2022-04-08 04:06:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:06:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 134 [2022-04-08 04:06:52,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:06:52,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:06:52,427 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-08 04:06:52,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-08 04:06:52,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:06:52,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-08 04:06:52,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1539, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 04:06:52,428 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:06:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:06:53,728 INFO L93 Difference]: Finished difference Result 200 states and 214 transitions. [2022-04-08 04:06:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 04:06:53,728 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 134 [2022-04-08 04:06:53,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:06:53,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:06:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 120 transitions. [2022-04-08 04:06:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:06:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 120 transitions. [2022-04-08 04:06:53,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 120 transitions. [2022-04-08 04:06:53,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:06:53,844 INFO L225 Difference]: With dead ends: 200 [2022-04-08 04:06:53,844 INFO L226 Difference]: Without dead ends: 140 [2022-04-08 04:06:53,844 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=906, Invalid=4206, Unknown=0, NotChecked=0, Total=5112 [2022-04-08 04:06:53,845 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:06:53,845 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 74 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 04:06:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-08 04:06:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2022-04-08 04:06:53,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:06:53,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:06:53,959 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:06:53,959 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:06:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:06:53,961 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-08 04:06:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-08 04:06:53,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:06:53,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:06:53,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 140 states. [2022-04-08 04:06:53,961 INFO L87 Difference]: Start difference. First operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 140 states. [2022-04-08 04:06:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:06:53,963 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-08 04:06:53,963 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-08 04:06:53,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:06:53,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:06:53,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:06:53,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:06:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:06:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2022-04-08 04:06:53,965 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2022-04-08 04:06:53,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:06:53,965 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2022-04-08 04:06:53,965 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:06:53,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 140 transitions. [2022-04-08 04:06:54,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:06:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2022-04-08 04:06:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-08 04:06:54,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:06:54,187 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:06:54,204 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-08 04:06:54,391 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,SelfDestructingSolverStorable24 [2022-04-08 04:06:54,391 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:06:54,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:06:54,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1055030388, now seen corresponding path program 47 times [2022-04-08 04:06:54,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:06:54,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1596984014] [2022-04-08 04:06:54,394 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:06:54,394 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:06:54,394 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:06:54,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1055030388, now seen corresponding path program 48 times [2022-04-08 04:06:54,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:06:54,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411190508] [2022-04-08 04:06:54,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:06:54,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:06:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:06:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {24863#(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(9, 2); {24779#true} is VALID [2022-04-08 04:06:55,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-08 04:06:55,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-08 04:06:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-08 04:06:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-08 04:06:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 04:06:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-08 04:06:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} #68#return; {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-08 04:06:55,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-08 04:06:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-08 04:06:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-08 04:06:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-08 04:06:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-04-08 04:06:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-04-08 04:06:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-04-08 04:06:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {24779#true} call ULTIMATE.init(); {24863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:06:55,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {24863#(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(9, 2); {24779#true} is VALID [2022-04-08 04:06:55,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-08 04:06:55,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {24779#true} call #t~ret6 := main(); {24779#true} is VALID [2022-04-08 04:06:55,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {24779#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24779#true} is VALID [2022-04-08 04:06:55,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {24779#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {24784#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-08 04:06:55,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {24784#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24784#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-08 04:06:55,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {24784#(and (= main_~x~0.offset 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24785#(and (= main_~x~0.offset 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:06:55,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {24785#(and (= main_~x~0.offset 0) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24785#(and (= main_~x~0.offset 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:06:55,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {24785#(and (= main_~x~0.offset 0) (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24786#(and (= main_~x~0.offset 0) (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:06:55,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {24786#(and (= main_~x~0.offset 0) (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24786#(and (= main_~x~0.offset 0) (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:06:55,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {24786#(and (= main_~x~0.offset 0) (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24787#(and (= main_~x~0.offset 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:06:55,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {24787#(and (= main_~x~0.offset 0) (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24787#(and (= main_~x~0.offset 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:06:55,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {24787#(and (= main_~x~0.offset 0) (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24788#(and (= main_~x~0.offset 0) (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:06:55,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {24788#(and (= main_~x~0.offset 0) (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24788#(and (= main_~x~0.offset 0) (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:06:55,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {24788#(and (= main_~x~0.offset 0) (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24789#(and (= main_~x~0.offset 0) (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:06:55,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {24789#(and (= main_~x~0.offset 0) (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24789#(and (= main_~x~0.offset 0) (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:06:55,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {24789#(and (= main_~x~0.offset 0) (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24790#(and (= main_~x~0.offset 0) (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:06:55,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {24790#(and (= main_~x~0.offset 0) (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24790#(and (= main_~x~0.offset 0) (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:06:55,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {24790#(and (= main_~x~0.offset 0) (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24791#(and (<= main_~i~0 7) (= main_~x~0.offset 0) (<= 7 main_~i~0))} is VALID [2022-04-08 04:06:55,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {24791#(and (<= main_~i~0 7) (= main_~x~0.offset 0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24791#(and (<= main_~i~0 7) (= main_~x~0.offset 0) (<= 7 main_~i~0))} is VALID [2022-04-08 04:06:55,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {24791#(and (<= main_~i~0 7) (= main_~x~0.offset 0) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24792#(and (= main_~x~0.offset 0) (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:06:55,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {24792#(and (= main_~x~0.offset 0) (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24792#(and (= main_~x~0.offset 0) (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:06:55,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {24792#(and (= main_~x~0.offset 0) (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24793#(and (= main_~x~0.offset 0) (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:06:55,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {24793#(and (= main_~x~0.offset 0) (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24793#(and (= main_~x~0.offset 0) (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:06:55,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {24793#(and (= main_~x~0.offset 0) (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24794#(and (= main_~x~0.offset 0) (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-08 04:06:55,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {24794#(and (= main_~x~0.offset 0) (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24794#(and (= main_~x~0.offset 0) (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-08 04:06:55,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {24794#(and (= main_~x~0.offset 0) (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24795#(and (= main_~x~0.offset 0) (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-08 04:06:55,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {24795#(and (= main_~x~0.offset 0) (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24795#(and (= main_~x~0.offset 0) (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-08 04:06:55,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {24795#(and (= main_~x~0.offset 0) (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24796#(and (= main_~x~0.offset 0) (not (<= (+ main_~x~0.offset (* main_~i~0 4)) 47)) (<= main_~i~0 12))} is VALID [2022-04-08 04:06:55,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {24796#(and (= main_~x~0.offset 0) (not (<= (+ main_~x~0.offset (* main_~i~0 4)) 47)) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24797#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (= main_~x~0.offset 0) (not (<= (+ main_~x~0.offset (* main_~i~0 4)) 47)) (<= main_~i~0 12))} is VALID [2022-04-08 04:06:55,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {24797#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (= main_~x~0.offset 0) (not (<= (+ main_~x~0.offset (* main_~i~0 4)) 47)) (<= main_~i~0 12))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {24798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !(~i~0 < ~n~0); {24798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {24798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} ~i~1 := 0; {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,293 INFO L272 TraceCheckUtils]: 36: Hoare triple {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-08 04:06:55,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,293 INFO L290 TraceCheckUtils]: 38: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,294 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24779#true} {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,294 INFO L290 TraceCheckUtils]: 42: Hoare triple {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,294 INFO L290 TraceCheckUtils]: 43: Hoare triple {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,295 INFO L272 TraceCheckUtils]: 44: Hoare triple {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-08 04:06:55,295 INFO L290 TraceCheckUtils]: 45: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,295 INFO L290 TraceCheckUtils]: 46: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,295 INFO L290 TraceCheckUtils]: 47: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,295 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24779#true} {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,296 INFO L290 TraceCheckUtils]: 49: Hoare triple {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,296 INFO L290 TraceCheckUtils]: 50: Hoare triple {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,296 INFO L290 TraceCheckUtils]: 51: Hoare triple {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,296 INFO L272 TraceCheckUtils]: 52: Hoare triple {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-08 04:06:55,296 INFO L290 TraceCheckUtils]: 53: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,297 INFO L290 TraceCheckUtils]: 55: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,297 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {24779#true} {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,298 INFO L290 TraceCheckUtils]: 58: Hoare triple {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,298 INFO L290 TraceCheckUtils]: 59: Hoare triple {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,298 INFO L272 TraceCheckUtils]: 60: Hoare triple {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-08 04:06:55,298 INFO L290 TraceCheckUtils]: 61: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,298 INFO L290 TraceCheckUtils]: 62: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,298 INFO L290 TraceCheckUtils]: 63: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,299 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24779#true} {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,299 INFO L290 TraceCheckUtils]: 65: Hoare triple {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,300 INFO L290 TraceCheckUtils]: 66: Hoare triple {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-08 04:06:55,300 INFO L290 TraceCheckUtils]: 67: Hoare triple {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-08 04:06:55,300 INFO L272 TraceCheckUtils]: 68: Hoare triple {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-08 04:06:55,300 INFO L290 TraceCheckUtils]: 69: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,300 INFO L290 TraceCheckUtils]: 70: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,300 INFO L290 TraceCheckUtils]: 71: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,301 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {24779#true} {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} #68#return; {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-08 04:06:55,301 INFO L290 TraceCheckUtils]: 73: Hoare triple {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} havoc #t~mem5; {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-08 04:06:55,301 INFO L290 TraceCheckUtils]: 74: Hoare triple {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,302 INFO L290 TraceCheckUtils]: 75: Hoare triple {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,302 INFO L272 TraceCheckUtils]: 76: Hoare triple {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-08 04:06:55,302 INFO L290 TraceCheckUtils]: 77: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,302 INFO L290 TraceCheckUtils]: 78: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,302 INFO L290 TraceCheckUtils]: 79: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,303 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24779#true} {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,303 INFO L290 TraceCheckUtils]: 81: Hoare triple {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,303 INFO L290 TraceCheckUtils]: 82: Hoare triple {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,304 INFO L290 TraceCheckUtils]: 83: Hoare triple {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,304 INFO L272 TraceCheckUtils]: 84: Hoare triple {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-08 04:06:55,304 INFO L290 TraceCheckUtils]: 85: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,304 INFO L290 TraceCheckUtils]: 86: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,304 INFO L290 TraceCheckUtils]: 87: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,304 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {24779#true} {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,305 INFO L290 TraceCheckUtils]: 89: Hoare triple {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,305 INFO L290 TraceCheckUtils]: 90: Hoare triple {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,305 INFO L290 TraceCheckUtils]: 91: Hoare triple {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,306 INFO L272 TraceCheckUtils]: 92: Hoare triple {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-08 04:06:55,306 INFO L290 TraceCheckUtils]: 93: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,306 INFO L290 TraceCheckUtils]: 94: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,306 INFO L290 TraceCheckUtils]: 95: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,306 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {24779#true} {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,306 INFO L290 TraceCheckUtils]: 97: Hoare triple {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,307 INFO L290 TraceCheckUtils]: 98: Hoare triple {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,307 INFO L290 TraceCheckUtils]: 99: Hoare triple {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,307 INFO L272 TraceCheckUtils]: 100: Hoare triple {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-08 04:06:55,307 INFO L290 TraceCheckUtils]: 101: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,307 INFO L290 TraceCheckUtils]: 102: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,308 INFO L290 TraceCheckUtils]: 103: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,308 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {24779#true} {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,308 INFO L290 TraceCheckUtils]: 105: Hoare triple {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,309 INFO L290 TraceCheckUtils]: 106: Hoare triple {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,309 INFO L290 TraceCheckUtils]: 107: Hoare triple {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,309 INFO L272 TraceCheckUtils]: 108: Hoare triple {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-08 04:06:55,309 INFO L290 TraceCheckUtils]: 109: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,309 INFO L290 TraceCheckUtils]: 110: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,309 INFO L290 TraceCheckUtils]: 111: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,310 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {24779#true} {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,310 INFO L290 TraceCheckUtils]: 113: Hoare triple {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,310 INFO L290 TraceCheckUtils]: 114: Hoare triple {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,311 INFO L290 TraceCheckUtils]: 115: Hoare triple {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,311 INFO L272 TraceCheckUtils]: 116: Hoare triple {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-08 04:06:55,311 INFO L290 TraceCheckUtils]: 117: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,311 INFO L290 TraceCheckUtils]: 118: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,311 INFO L290 TraceCheckUtils]: 119: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,312 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {24779#true} {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,312 INFO L290 TraceCheckUtils]: 121: Hoare triple {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,312 INFO L290 TraceCheckUtils]: 122: Hoare triple {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,313 INFO L290 TraceCheckUtils]: 123: Hoare triple {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,313 INFO L272 TraceCheckUtils]: 124: Hoare triple {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-08 04:06:55,313 INFO L290 TraceCheckUtils]: 125: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-08 04:06:55,313 INFO L290 TraceCheckUtils]: 126: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-08 04:06:55,313 INFO L290 TraceCheckUtils]: 127: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:06:55,313 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {24779#true} {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,314 INFO L290 TraceCheckUtils]: 129: Hoare triple {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-08 04:06:55,314 INFO L290 TraceCheckUtils]: 130: Hoare triple {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24859#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= 48 (+ main_~x~0.offset (* main_~i~1 4))))} is VALID [2022-04-08 04:06:55,314 INFO L290 TraceCheckUtils]: 131: Hoare triple {24859#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= 48 (+ main_~x~0.offset (* main_~i~1 4))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24860#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:06:55,315 INFO L272 TraceCheckUtils]: 132: Hoare triple {24860#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24861#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:06:55,315 INFO L290 TraceCheckUtils]: 133: Hoare triple {24861#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {24862#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:06:55,315 INFO L290 TraceCheckUtils]: 134: Hoare triple {24862#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24780#false} is VALID [2022-04-08 04:06:55,315 INFO L290 TraceCheckUtils]: 135: Hoare triple {24780#false} assume !false; {24780#false} is VALID [2022-04-08 04:06:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 24 proven. 457 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 04:06:55,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:06:55,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411190508] [2022-04-08 04:06:55,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411190508] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:06:55,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747004694] [2022-04-08 04:06:55,317 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:06:55,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:06:55,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:06:55,317 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-08 04:06:55,319 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-08 04:06:55,620 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-04-08 04:06:55,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:06:55,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-08 04:06:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:55,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:06:56,064 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-08 04:07:05,790 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-08 04:07:05,790 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 23 treesize of output 10 [2022-04-08 04:07:05,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {24779#true} call ULTIMATE.init(); {24779#true} is VALID [2022-04-08 04:07:05,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#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(9, 2); {24779#true} is VALID [2022-04-08 04:07:05,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-08 04:07:05,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-08 04:07:05,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {24779#true} call #t~ret6 := main(); {24779#true} is VALID [2022-04-08 04:07:05,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {24779#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24779#true} is VALID [2022-04-08 04:07:05,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {24779#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {24885#(<= main_~i~0 0)} is VALID [2022-04-08 04:07:05,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {24885#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24885#(<= main_~i~0 0)} is VALID [2022-04-08 04:07:05,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {24885#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24892#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:05,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {24892#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24892#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:05,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {24892#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24899#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:05,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {24899#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24899#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:05,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {24899#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24906#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:05,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {24906#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24906#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:05,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {24906#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24913#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:05,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {24913#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24913#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:05,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {24913#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24920#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:05,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {24920#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24920#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:05,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {24920#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24927#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:05,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {24927#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24927#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:05,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {24927#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24934#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:05,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {24934#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24934#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:05,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {24934#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24941#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:05,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {24941#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24941#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:05,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {24941#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24948#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:05,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {24948#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24948#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:05,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {24948#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24955#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:05,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {24955#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24955#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:05,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {24955#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24962#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:05,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {24962#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24962#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:05,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {24962#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24969#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:05,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {24969#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24973#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 12))} is VALID [2022-04-08 04:07:05,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {24973#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 12))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24977#(exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~i~0 (+ v_main_~i~0_336 1))))} is VALID [2022-04-08 04:07:05,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {24977#(exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~i~0 (+ v_main_~i~0_336 1))))} assume !(~i~0 < ~n~0); {24981#(exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1))))} is VALID [2022-04-08 04:07:05,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {24981#(exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1))))} ~i~1 := 0; {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} is VALID [2022-04-08 04:07:05,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} is VALID [2022-04-08 04:07:05,901 INFO L272 TraceCheckUtils]: 36: Hoare triple {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,902 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} #68#return; {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} is VALID [2022-04-08 04:07:05,903 INFO L290 TraceCheckUtils]: 41: Hoare triple {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} havoc #t~mem5; {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} is VALID [2022-04-08 04:07:05,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} is VALID [2022-04-08 04:07:05,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} is VALID [2022-04-08 04:07:05,907 INFO L272 TraceCheckUtils]: 44: Hoare triple {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,907 INFO L290 TraceCheckUtils]: 45: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,907 INFO L290 TraceCheckUtils]: 46: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,908 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} #68#return; {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} is VALID [2022-04-08 04:07:05,908 INFO L290 TraceCheckUtils]: 49: Hoare triple {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} havoc #t~mem5; {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} is VALID [2022-04-08 04:07:05,909 INFO L290 TraceCheckUtils]: 50: Hoare triple {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:07:05,909 INFO L290 TraceCheckUtils]: 51: Hoare triple {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:07:05,912 INFO L272 TraceCheckUtils]: 52: Hoare triple {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,913 INFO L290 TraceCheckUtils]: 53: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,913 INFO L290 TraceCheckUtils]: 54: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,913 INFO L290 TraceCheckUtils]: 55: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,914 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} #68#return; {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:07:05,914 INFO L290 TraceCheckUtils]: 57: Hoare triple {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} havoc #t~mem5; {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:07:05,915 INFO L290 TraceCheckUtils]: 58: Hoare triple {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:07:05,915 INFO L290 TraceCheckUtils]: 59: Hoare triple {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:07:05,919 INFO L272 TraceCheckUtils]: 60: Hoare triple {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,920 INFO L290 TraceCheckUtils]: 61: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,920 INFO L290 TraceCheckUtils]: 62: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,920 INFO L290 TraceCheckUtils]: 63: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,921 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} #68#return; {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:07:05,921 INFO L290 TraceCheckUtils]: 65: Hoare triple {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} havoc #t~mem5; {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:07:05,922 INFO L290 TraceCheckUtils]: 66: Hoare triple {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:07:05,922 INFO L290 TraceCheckUtils]: 67: Hoare triple {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:07:05,924 INFO L272 TraceCheckUtils]: 68: Hoare triple {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,925 INFO L290 TraceCheckUtils]: 70: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,925 INFO L290 TraceCheckUtils]: 71: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,926 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} #68#return; {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:07:05,926 INFO L290 TraceCheckUtils]: 73: Hoare triple {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} havoc #t~mem5; {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:07:05,927 INFO L290 TraceCheckUtils]: 74: Hoare triple {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} is VALID [2022-04-08 04:07:05,927 INFO L290 TraceCheckUtils]: 75: Hoare triple {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} is VALID [2022-04-08 04:07:05,929 INFO L272 TraceCheckUtils]: 76: Hoare triple {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,929 INFO L290 TraceCheckUtils]: 77: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,930 INFO L290 TraceCheckUtils]: 78: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,930 INFO L290 TraceCheckUtils]: 79: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,930 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} #68#return; {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} is VALID [2022-04-08 04:07:05,931 INFO L290 TraceCheckUtils]: 81: Hoare triple {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} havoc #t~mem5; {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} is VALID [2022-04-08 04:07:05,931 INFO L290 TraceCheckUtils]: 82: Hoare triple {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} is VALID [2022-04-08 04:07:05,932 INFO L290 TraceCheckUtils]: 83: Hoare triple {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} is VALID [2022-04-08 04:07:05,937 INFO L272 TraceCheckUtils]: 84: Hoare triple {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,937 INFO L290 TraceCheckUtils]: 85: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,938 INFO L290 TraceCheckUtils]: 86: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,938 INFO L290 TraceCheckUtils]: 87: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,938 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} #68#return; {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} is VALID [2022-04-08 04:07:05,939 INFO L290 TraceCheckUtils]: 89: Hoare triple {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} havoc #t~mem5; {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} is VALID [2022-04-08 04:07:05,939 INFO L290 TraceCheckUtils]: 90: Hoare triple {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} is VALID [2022-04-08 04:07:05,940 INFO L290 TraceCheckUtils]: 91: Hoare triple {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} is VALID [2022-04-08 04:07:05,943 INFO L272 TraceCheckUtils]: 92: Hoare triple {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,943 INFO L290 TraceCheckUtils]: 93: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,943 INFO L290 TraceCheckUtils]: 94: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,944 INFO L290 TraceCheckUtils]: 95: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,944 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} #68#return; {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} is VALID [2022-04-08 04:07:05,944 INFO L290 TraceCheckUtils]: 97: Hoare triple {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} havoc #t~mem5; {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} is VALID [2022-04-08 04:07:05,945 INFO L290 TraceCheckUtils]: 98: Hoare triple {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} is VALID [2022-04-08 04:07:05,945 INFO L290 TraceCheckUtils]: 99: Hoare triple {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} is VALID [2022-04-08 04:07:05,949 INFO L272 TraceCheckUtils]: 100: Hoare triple {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,949 INFO L290 TraceCheckUtils]: 101: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,949 INFO L290 TraceCheckUtils]: 102: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,950 INFO L290 TraceCheckUtils]: 103: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,950 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} #68#return; {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} is VALID [2022-04-08 04:07:05,951 INFO L290 TraceCheckUtils]: 105: Hoare triple {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} havoc #t~mem5; {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} is VALID [2022-04-08 04:07:05,951 INFO L290 TraceCheckUtils]: 106: Hoare triple {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} is VALID [2022-04-08 04:07:05,952 INFO L290 TraceCheckUtils]: 107: Hoare triple {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} is VALID [2022-04-08 04:07:05,956 INFO L272 TraceCheckUtils]: 108: Hoare triple {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,957 INFO L290 TraceCheckUtils]: 109: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,957 INFO L290 TraceCheckUtils]: 110: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,957 INFO L290 TraceCheckUtils]: 111: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,958 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} #68#return; {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} is VALID [2022-04-08 04:07:05,958 INFO L290 TraceCheckUtils]: 113: Hoare triple {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} havoc #t~mem5; {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} is VALID [2022-04-08 04:07:05,959 INFO L290 TraceCheckUtils]: 114: Hoare triple {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} is VALID [2022-04-08 04:07:05,959 INFO L290 TraceCheckUtils]: 115: Hoare triple {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} is VALID [2022-04-08 04:07:05,966 INFO L272 TraceCheckUtils]: 116: Hoare triple {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,967 INFO L290 TraceCheckUtils]: 117: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,967 INFO L290 TraceCheckUtils]: 118: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,967 INFO L290 TraceCheckUtils]: 119: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,968 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} #68#return; {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} is VALID [2022-04-08 04:07:05,968 INFO L290 TraceCheckUtils]: 121: Hoare triple {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} havoc #t~mem5; {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} is VALID [2022-04-08 04:07:05,969 INFO L290 TraceCheckUtils]: 122: Hoare triple {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} is VALID [2022-04-08 04:07:05,969 INFO L290 TraceCheckUtils]: 123: Hoare triple {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} is VALID [2022-04-08 04:07:05,972 INFO L272 TraceCheckUtils]: 124: Hoare triple {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,973 INFO L290 TraceCheckUtils]: 125: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,973 INFO L290 TraceCheckUtils]: 126: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,973 INFO L290 TraceCheckUtils]: 127: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-08 04:07:05,974 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} #68#return; {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} is VALID [2022-04-08 04:07:05,974 INFO L290 TraceCheckUtils]: 129: Hoare triple {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} havoc #t~mem5; {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} is VALID [2022-04-08 04:07:05,975 INFO L290 TraceCheckUtils]: 130: Hoare triple {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25286#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 12 main_~i~1))} is VALID [2022-04-08 04:07:05,975 INFO L290 TraceCheckUtils]: 131: Hoare triple {25286#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 12 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24860#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:07:05,976 INFO L272 TraceCheckUtils]: 132: Hoare triple {24860#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {25293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:07:05,976 INFO L290 TraceCheckUtils]: 133: Hoare triple {25293#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:07:05,976 INFO L290 TraceCheckUtils]: 134: Hoare triple {25297#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24780#false} is VALID [2022-04-08 04:07:05,976 INFO L290 TraceCheckUtils]: 135: Hoare triple {24780#false} assume !false; {24780#false} is VALID [2022-04-08 04:07:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 276 proven. 205 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 04:07:05,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:07:06,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747004694] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:07:06,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:07:06,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 66 [2022-04-08 04:07:06,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:07:06,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1596984014] [2022-04-08 04:07:06,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1596984014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:07:06,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:07:06,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-08 04:07:06,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752952082] [2022-04-08 04:07:06,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:07:06,278 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 136 [2022-04-08 04:07:06,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:07:06,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:07:06,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:07:06,362 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-08 04:07:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:07:06,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-08 04:07:06,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=4106, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 04:07:06,363 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:07:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:12,119 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2022-04-08 04:07:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 04:07:12,119 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 136 [2022-04-08 04:07:12,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:07:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:07:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 117 transitions. [2022-04-08 04:07:12,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:07:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 117 transitions. [2022-04-08 04:07:12,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 117 transitions. [2022-04-08 04:07:12,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:07:12,346 INFO L225 Difference]: With dead ends: 152 [2022-04-08 04:07:12,347 INFO L226 Difference]: Without dead ends: 150 [2022-04-08 04:07:12,348 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 112 SyntacticMatches, 24 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3282 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=727, Invalid=9173, Unknown=0, NotChecked=0, Total=9900 [2022-04-08 04:07:12,348 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 88 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3192 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 04:07:12,348 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 183 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3192 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 04:07:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-08 04:07:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-04-08 04:07:12,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:07:12,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 04:07:12,514 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 04:07:12,515 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 04:07:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:12,517 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-08 04:07:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-08 04:07:12,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:07:12,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:07:12,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 150 states. [2022-04-08 04:07:12,518 INFO L87 Difference]: Start difference. First operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 150 states. [2022-04-08 04:07:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:12,520 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-08 04:07:12,520 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-08 04:07:12,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:07:12,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:07:12,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:07:12,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:07:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 04:07:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2022-04-08 04:07:12,523 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 136 [2022-04-08 04:07:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:07:12,523 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2022-04-08 04:07:12,523 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:07:12,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 148 transitions. [2022-04-08 04:07:12,760 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-08 04:07:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2022-04-08 04:07:12,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-08 04:07:12,760 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:07:12,761 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:07:12,782 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-08 04:07:12,961 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,SelfDestructingSolverStorable25 [2022-04-08 04:07:12,961 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:07:12,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:07:12,962 INFO L85 PathProgramCache]: Analyzing trace with hash -490496666, now seen corresponding path program 49 times [2022-04-08 04:07:12,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:07:12,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [852789716] [2022-04-08 04:07:12,964 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:07:12,964 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:07:12,964 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:07:12,964 INFO L85 PathProgramCache]: Analyzing trace with hash -490496666, now seen corresponding path program 50 times [2022-04-08 04:07:12,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:07:12,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873724878] [2022-04-08 04:07:12,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:07:12,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:07:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:07:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {26377#(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(9, 2); {26291#true} is VALID [2022-04-08 04:07:13,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26291#true} {26291#true} #70#return; {26291#true} is VALID [2022-04-08 04:07:13,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-08 04:07:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} #68#return; {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-08 04:07:13,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-08 04:07:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26316#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:13,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-08 04:07:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26321#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:13,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 04:07:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26326#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:13,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-08 04:07:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26331#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:13,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-08 04:07:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26336#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:13,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-08 04:07:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26341#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:13,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-08 04:07:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26346#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:13,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-08 04:07:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26351#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:13,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-04-08 04:07:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26356#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:13,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-04-08 04:07:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26361#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:13,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-04-08 04:07:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26366#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:13,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-04-08 04:07:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26371#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:13,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {26291#true} call ULTIMATE.init(); {26377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:07:13,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {26377#(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(9, 2); {26291#true} is VALID [2022-04-08 04:07:13,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26291#true} #70#return; {26291#true} is VALID [2022-04-08 04:07:13,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {26291#true} call #t~ret6 := main(); {26291#true} is VALID [2022-04-08 04:07:13,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {26291#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26291#true} is VALID [2022-04-08 04:07:13,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {26291#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {26296#(= main_~i~0 0)} is VALID [2022-04-08 04:07:13,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {26296#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26296#(= main_~i~0 0)} is VALID [2022-04-08 04:07:13,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {26296#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26297#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:13,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {26297#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26297#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:13,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {26297#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26298#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:13,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {26298#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26298#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:13,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {26298#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26299#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:13,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {26299#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26299#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:13,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {26299#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26300#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:13,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {26300#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26300#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:13,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {26300#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26301#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:13,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {26301#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26301#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:13,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {26301#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26302#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:13,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {26302#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26302#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:13,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {26302#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26303#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:13,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {26303#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26303#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:13,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {26303#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26304#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:13,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {26304#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26304#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:13,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {26304#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26305#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:13,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {26305#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26305#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:13,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {26305#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26306#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:13,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {26306#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26306#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:13,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {26306#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26307#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:13,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {26307#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26307#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:13,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {26307#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26308#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:13,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {26308#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26308#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:13,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {26308#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26309#(<= main_~i~0 13)} is VALID [2022-04-08 04:07:13,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {26309#(<= main_~i~0 13)} assume !(~i~0 < ~n~0); {26310#(<= main_~n~0 13)} is VALID [2022-04-08 04:07:13,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {26310#(<= main_~n~0 13)} ~i~1 := 0; {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-08 04:07:13,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-08 04:07:13,365 INFO L272 TraceCheckUtils]: 36: Hoare triple {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:13,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,366 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {26291#true} {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} #68#return; {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-08 04:07:13,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} havoc #t~mem5; {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-08 04:07:13,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:13,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:13,367 INFO L272 TraceCheckUtils]: 44: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:13,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,368 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {26291#true} {26316#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:13,368 INFO L290 TraceCheckUtils]: 49: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:13,368 INFO L290 TraceCheckUtils]: 50: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:13,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:13,369 INFO L272 TraceCheckUtils]: 52: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:13,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,369 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {26291#true} {26321#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:13,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:13,370 INFO L290 TraceCheckUtils]: 58: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:13,370 INFO L290 TraceCheckUtils]: 59: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:13,370 INFO L272 TraceCheckUtils]: 60: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:13,370 INFO L290 TraceCheckUtils]: 61: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,370 INFO L290 TraceCheckUtils]: 62: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,370 INFO L290 TraceCheckUtils]: 63: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,371 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {26291#true} {26326#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:13,371 INFO L290 TraceCheckUtils]: 65: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:13,371 INFO L290 TraceCheckUtils]: 66: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:13,372 INFO L290 TraceCheckUtils]: 67: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:13,372 INFO L272 TraceCheckUtils]: 68: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:13,372 INFO L290 TraceCheckUtils]: 69: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,372 INFO L290 TraceCheckUtils]: 70: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,372 INFO L290 TraceCheckUtils]: 71: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,372 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {26291#true} {26331#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:13,373 INFO L290 TraceCheckUtils]: 73: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:13,373 INFO L290 TraceCheckUtils]: 74: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:13,373 INFO L290 TraceCheckUtils]: 75: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:13,373 INFO L272 TraceCheckUtils]: 76: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:13,373 INFO L290 TraceCheckUtils]: 77: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,374 INFO L290 TraceCheckUtils]: 78: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,374 INFO L290 TraceCheckUtils]: 79: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,374 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {26291#true} {26336#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:13,374 INFO L290 TraceCheckUtils]: 81: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:13,375 INFO L290 TraceCheckUtils]: 82: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:13,375 INFO L290 TraceCheckUtils]: 83: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:13,375 INFO L272 TraceCheckUtils]: 84: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:13,375 INFO L290 TraceCheckUtils]: 85: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,375 INFO L290 TraceCheckUtils]: 86: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,375 INFO L290 TraceCheckUtils]: 87: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,376 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {26291#true} {26341#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:13,376 INFO L290 TraceCheckUtils]: 89: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:13,376 INFO L290 TraceCheckUtils]: 90: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:13,376 INFO L290 TraceCheckUtils]: 91: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:13,377 INFO L272 TraceCheckUtils]: 92: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:13,377 INFO L290 TraceCheckUtils]: 93: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,377 INFO L290 TraceCheckUtils]: 94: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,377 INFO L290 TraceCheckUtils]: 95: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,377 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {26291#true} {26346#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:13,377 INFO L290 TraceCheckUtils]: 97: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:13,378 INFO L290 TraceCheckUtils]: 98: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:13,378 INFO L290 TraceCheckUtils]: 99: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:13,378 INFO L272 TraceCheckUtils]: 100: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:13,378 INFO L290 TraceCheckUtils]: 101: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,378 INFO L290 TraceCheckUtils]: 102: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,378 INFO L290 TraceCheckUtils]: 103: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,379 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26291#true} {26351#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:13,379 INFO L290 TraceCheckUtils]: 105: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:13,379 INFO L290 TraceCheckUtils]: 106: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:13,380 INFO L290 TraceCheckUtils]: 107: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:13,380 INFO L272 TraceCheckUtils]: 108: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:13,380 INFO L290 TraceCheckUtils]: 109: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,380 INFO L290 TraceCheckUtils]: 110: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,380 INFO L290 TraceCheckUtils]: 111: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,380 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {26291#true} {26356#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:13,381 INFO L290 TraceCheckUtils]: 113: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:13,381 INFO L290 TraceCheckUtils]: 114: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:13,381 INFO L290 TraceCheckUtils]: 115: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:13,381 INFO L272 TraceCheckUtils]: 116: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:13,381 INFO L290 TraceCheckUtils]: 117: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,381 INFO L290 TraceCheckUtils]: 118: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,382 INFO L290 TraceCheckUtils]: 119: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,382 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {26291#true} {26361#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:13,382 INFO L290 TraceCheckUtils]: 121: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:13,383 INFO L290 TraceCheckUtils]: 122: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:13,383 INFO L290 TraceCheckUtils]: 123: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:13,383 INFO L272 TraceCheckUtils]: 124: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:13,383 INFO L290 TraceCheckUtils]: 125: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,383 INFO L290 TraceCheckUtils]: 126: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,383 INFO L290 TraceCheckUtils]: 127: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,384 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {26291#true} {26366#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:13,384 INFO L290 TraceCheckUtils]: 129: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:13,384 INFO L290 TraceCheckUtils]: 130: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:13,385 INFO L290 TraceCheckUtils]: 131: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:13,385 INFO L272 TraceCheckUtils]: 132: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:13,385 INFO L290 TraceCheckUtils]: 133: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:13,385 INFO L290 TraceCheckUtils]: 134: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:13,385 INFO L290 TraceCheckUtils]: 135: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:13,385 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {26291#true} {26371#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:13,385 INFO L290 TraceCheckUtils]: 137: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:13,386 INFO L290 TraceCheckUtils]: 138: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26376#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:07:13,386 INFO L290 TraceCheckUtils]: 139: Hoare triple {26376#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26292#false} is VALID [2022-04-08 04:07:13,386 INFO L272 TraceCheckUtils]: 140: Hoare triple {26292#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#false} is VALID [2022-04-08 04:07:13,386 INFO L290 TraceCheckUtils]: 141: Hoare triple {26292#false} ~cond := #in~cond; {26292#false} is VALID [2022-04-08 04:07:13,386 INFO L290 TraceCheckUtils]: 142: Hoare triple {26292#false} assume 0 == ~cond; {26292#false} is VALID [2022-04-08 04:07:13,386 INFO L290 TraceCheckUtils]: 143: Hoare triple {26292#false} assume !false; {26292#false} is VALID [2022-04-08 04:07:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 315 proven. 218 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 04:07:13,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:07:13,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873724878] [2022-04-08 04:07:13,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873724878] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:07:13,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860556466] [2022-04-08 04:07:13,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:07:13,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:07:13,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:07:13,388 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-08 04:07:13,390 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-08 04:07:13,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:07:13,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:07:13,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 04:07:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:13,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:07:14,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {26291#true} call ULTIMATE.init(); {26291#true} is VALID [2022-04-08 04:07:14,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#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(9, 2); {26291#true} is VALID [2022-04-08 04:07:14,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:14,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26291#true} #70#return; {26291#true} is VALID [2022-04-08 04:07:14,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {26291#true} call #t~ret6 := main(); {26291#true} is VALID [2022-04-08 04:07:14,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {26291#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26291#true} is VALID [2022-04-08 04:07:14,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {26291#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {26399#(<= main_~i~0 0)} is VALID [2022-04-08 04:07:14,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {26399#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26399#(<= main_~i~0 0)} is VALID [2022-04-08 04:07:14,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {26399#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26297#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:14,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {26297#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26297#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:14,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {26297#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26298#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:14,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {26298#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26298#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:14,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {26298#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26299#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:14,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {26299#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26299#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:14,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {26299#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26300#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:14,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {26300#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26300#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:14,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {26300#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26301#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:14,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {26301#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26301#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:14,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {26301#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26302#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:14,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {26302#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26302#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:14,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {26302#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26303#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:14,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {26303#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26303#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:14,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {26303#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26304#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:14,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {26304#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26304#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:14,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {26304#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26305#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:14,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {26305#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26305#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:14,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {26305#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26306#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:14,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {26306#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26306#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:14,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {26306#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26307#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:14,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {26307#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26307#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:14,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {26307#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26308#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:14,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {26308#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26308#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:14,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {26308#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26309#(<= main_~i~0 13)} is VALID [2022-04-08 04:07:14,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {26309#(<= main_~i~0 13)} assume !(~i~0 < ~n~0); {26310#(<= main_~n~0 13)} is VALID [2022-04-08 04:07:14,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {26310#(<= main_~n~0 13)} ~i~1 := 0; {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} is VALID [2022-04-08 04:07:14,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} is VALID [2022-04-08 04:07:14,524 INFO L272 TraceCheckUtils]: 36: Hoare triple {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:14,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:14,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:14,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:14,525 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {26291#true} {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} #68#return; {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} is VALID [2022-04-08 04:07:14,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} havoc #t~mem5; {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} is VALID [2022-04-08 04:07:14,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,526 INFO L272 TraceCheckUtils]: 44: Hoare triple {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:14,526 INFO L290 TraceCheckUtils]: 45: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:14,526 INFO L290 TraceCheckUtils]: 46: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:14,526 INFO L290 TraceCheckUtils]: 47: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:14,527 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {26291#true} {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} #68#return; {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} havoc #t~mem5; {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,528 INFO L290 TraceCheckUtils]: 50: Hoare triple {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} is VALID [2022-04-08 04:07:14,528 INFO L290 TraceCheckUtils]: 51: Hoare triple {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} is VALID [2022-04-08 04:07:14,528 INFO L272 TraceCheckUtils]: 52: Hoare triple {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:14,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:14,528 INFO L290 TraceCheckUtils]: 54: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:14,528 INFO L290 TraceCheckUtils]: 55: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:14,529 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {26291#true} {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} #68#return; {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} is VALID [2022-04-08 04:07:14,529 INFO L290 TraceCheckUtils]: 57: Hoare triple {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} havoc #t~mem5; {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} is VALID [2022-04-08 04:07:14,530 INFO L290 TraceCheckUtils]: 58: Hoare triple {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} is VALID [2022-04-08 04:07:14,530 INFO L290 TraceCheckUtils]: 59: Hoare triple {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} is VALID [2022-04-08 04:07:14,530 INFO L272 TraceCheckUtils]: 60: Hoare triple {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:14,530 INFO L290 TraceCheckUtils]: 61: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:14,530 INFO L290 TraceCheckUtils]: 62: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:14,530 INFO L290 TraceCheckUtils]: 63: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:14,531 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {26291#true} {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} #68#return; {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} is VALID [2022-04-08 04:07:14,531 INFO L290 TraceCheckUtils]: 65: Hoare triple {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} havoc #t~mem5; {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} is VALID [2022-04-08 04:07:14,531 INFO L290 TraceCheckUtils]: 66: Hoare triple {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} is VALID [2022-04-08 04:07:14,532 INFO L290 TraceCheckUtils]: 67: Hoare triple {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} is VALID [2022-04-08 04:07:14,532 INFO L272 TraceCheckUtils]: 68: Hoare triple {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:14,532 INFO L290 TraceCheckUtils]: 69: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:14,532 INFO L290 TraceCheckUtils]: 70: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:14,532 INFO L290 TraceCheckUtils]: 71: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:14,533 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {26291#true} {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} #68#return; {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} is VALID [2022-04-08 04:07:14,533 INFO L290 TraceCheckUtils]: 73: Hoare triple {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} havoc #t~mem5; {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} is VALID [2022-04-08 04:07:14,533 INFO L290 TraceCheckUtils]: 74: Hoare triple {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} is VALID [2022-04-08 04:07:14,534 INFO L290 TraceCheckUtils]: 75: Hoare triple {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} is VALID [2022-04-08 04:07:14,534 INFO L272 TraceCheckUtils]: 76: Hoare triple {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:14,534 INFO L290 TraceCheckUtils]: 77: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:14,534 INFO L290 TraceCheckUtils]: 78: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:14,534 INFO L290 TraceCheckUtils]: 79: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:14,535 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {26291#true} {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} #68#return; {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} is VALID [2022-04-08 04:07:14,535 INFO L290 TraceCheckUtils]: 81: Hoare triple {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} havoc #t~mem5; {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} is VALID [2022-04-08 04:07:14,535 INFO L290 TraceCheckUtils]: 82: Hoare triple {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,536 INFO L290 TraceCheckUtils]: 83: Hoare triple {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,536 INFO L272 TraceCheckUtils]: 84: Hoare triple {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:14,536 INFO L290 TraceCheckUtils]: 85: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:14,536 INFO L290 TraceCheckUtils]: 86: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:14,536 INFO L290 TraceCheckUtils]: 87: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:14,537 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {26291#true} {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} #68#return; {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,537 INFO L290 TraceCheckUtils]: 89: Hoare triple {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} havoc #t~mem5; {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,538 INFO L290 TraceCheckUtils]: 90: Hoare triple {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} is VALID [2022-04-08 04:07:14,538 INFO L290 TraceCheckUtils]: 91: Hoare triple {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} is VALID [2022-04-08 04:07:14,538 INFO L272 TraceCheckUtils]: 92: Hoare triple {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:14,538 INFO L290 TraceCheckUtils]: 93: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:14,538 INFO L290 TraceCheckUtils]: 94: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:14,539 INFO L290 TraceCheckUtils]: 95: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:14,539 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {26291#true} {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} #68#return; {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} is VALID [2022-04-08 04:07:14,539 INFO L290 TraceCheckUtils]: 97: Hoare triple {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} havoc #t~mem5; {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} is VALID [2022-04-08 04:07:14,540 INFO L290 TraceCheckUtils]: 98: Hoare triple {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} is VALID [2022-04-08 04:07:14,540 INFO L290 TraceCheckUtils]: 99: Hoare triple {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} is VALID [2022-04-08 04:07:14,540 INFO L272 TraceCheckUtils]: 100: Hoare triple {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:14,541 INFO L290 TraceCheckUtils]: 101: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:14,541 INFO L290 TraceCheckUtils]: 102: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:14,541 INFO L290 TraceCheckUtils]: 103: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:14,541 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26291#true} {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} #68#return; {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} is VALID [2022-04-08 04:07:14,542 INFO L290 TraceCheckUtils]: 105: Hoare triple {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} havoc #t~mem5; {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} is VALID [2022-04-08 04:07:14,542 INFO L290 TraceCheckUtils]: 106: Hoare triple {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} is VALID [2022-04-08 04:07:14,543 INFO L290 TraceCheckUtils]: 107: Hoare triple {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} is VALID [2022-04-08 04:07:14,543 INFO L272 TraceCheckUtils]: 108: Hoare triple {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:14,543 INFO L290 TraceCheckUtils]: 109: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:14,543 INFO L290 TraceCheckUtils]: 110: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:14,543 INFO L290 TraceCheckUtils]: 111: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:14,544 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {26291#true} {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} #68#return; {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} is VALID [2022-04-08 04:07:14,544 INFO L290 TraceCheckUtils]: 113: Hoare triple {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} havoc #t~mem5; {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} is VALID [2022-04-08 04:07:14,544 INFO L290 TraceCheckUtils]: 114: Hoare triple {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,545 INFO L290 TraceCheckUtils]: 115: Hoare triple {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,545 INFO L272 TraceCheckUtils]: 116: Hoare triple {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:14,545 INFO L290 TraceCheckUtils]: 117: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:14,545 INFO L290 TraceCheckUtils]: 118: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:14,545 INFO L290 TraceCheckUtils]: 119: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:14,546 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {26291#true} {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} #68#return; {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,546 INFO L290 TraceCheckUtils]: 121: Hoare triple {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} havoc #t~mem5; {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,547 INFO L290 TraceCheckUtils]: 122: Hoare triple {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,547 INFO L290 TraceCheckUtils]: 123: Hoare triple {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,547 INFO L272 TraceCheckUtils]: 124: Hoare triple {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:14,547 INFO L290 TraceCheckUtils]: 125: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:14,547 INFO L290 TraceCheckUtils]: 126: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:14,548 INFO L290 TraceCheckUtils]: 127: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:14,548 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {26291#true} {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} #68#return; {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,548 INFO L290 TraceCheckUtils]: 129: Hoare triple {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} havoc #t~mem5; {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,549 INFO L290 TraceCheckUtils]: 130: Hoare triple {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} is VALID [2022-04-08 04:07:14,549 INFO L290 TraceCheckUtils]: 131: Hoare triple {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} is VALID [2022-04-08 04:07:14,549 INFO L272 TraceCheckUtils]: 132: Hoare triple {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:14,549 INFO L290 TraceCheckUtils]: 133: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:14,549 INFO L290 TraceCheckUtils]: 134: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:14,550 INFO L290 TraceCheckUtils]: 135: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:14,550 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {26291#true} {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} #68#return; {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} is VALID [2022-04-08 04:07:14,550 INFO L290 TraceCheckUtils]: 137: Hoare triple {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} havoc #t~mem5; {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} is VALID [2022-04-08 04:07:14,551 INFO L290 TraceCheckUtils]: 138: Hoare triple {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26809#(and (<= 13 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-08 04:07:14,551 INFO L290 TraceCheckUtils]: 139: Hoare triple {26809#(and (<= 13 main_~i~1) (<= main_~n~0 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26292#false} is VALID [2022-04-08 04:07:14,551 INFO L272 TraceCheckUtils]: 140: Hoare triple {26292#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#false} is VALID [2022-04-08 04:07:14,551 INFO L290 TraceCheckUtils]: 141: Hoare triple {26292#false} ~cond := #in~cond; {26292#false} is VALID [2022-04-08 04:07:14,551 INFO L290 TraceCheckUtils]: 142: Hoare triple {26292#false} assume 0 == ~cond; {26292#false} is VALID [2022-04-08 04:07:14,551 INFO L290 TraceCheckUtils]: 143: Hoare triple {26292#false} assume !false; {26292#false} is VALID [2022-04-08 04:07:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 364 proven. 169 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 04:07:14,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:07:15,178 INFO L290 TraceCheckUtils]: 143: Hoare triple {26292#false} assume !false; {26292#false} is VALID [2022-04-08 04:07:15,178 INFO L290 TraceCheckUtils]: 142: Hoare triple {26292#false} assume 0 == ~cond; {26292#false} is VALID [2022-04-08 04:07:15,178 INFO L290 TraceCheckUtils]: 141: Hoare triple {26292#false} ~cond := #in~cond; {26292#false} is VALID [2022-04-08 04:07:15,178 INFO L272 TraceCheckUtils]: 140: Hoare triple {26292#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#false} is VALID [2022-04-08 04:07:15,179 INFO L290 TraceCheckUtils]: 139: Hoare triple {26376#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26292#false} is VALID [2022-04-08 04:07:15,179 INFO L290 TraceCheckUtils]: 138: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26376#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:07:15,180 INFO L290 TraceCheckUtils]: 137: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:15,180 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {26291#true} {26371#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:15,180 INFO L290 TraceCheckUtils]: 135: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:15,180 INFO L290 TraceCheckUtils]: 134: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:15,180 INFO L290 TraceCheckUtils]: 133: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:15,180 INFO L272 TraceCheckUtils]: 132: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:15,181 INFO L290 TraceCheckUtils]: 131: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:15,181 INFO L290 TraceCheckUtils]: 130: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:15,181 INFO L290 TraceCheckUtils]: 129: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:15,182 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {26291#true} {26366#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:15,182 INFO L290 TraceCheckUtils]: 127: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:15,182 INFO L290 TraceCheckUtils]: 126: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:15,182 INFO L290 TraceCheckUtils]: 125: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:15,182 INFO L272 TraceCheckUtils]: 124: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:15,182 INFO L290 TraceCheckUtils]: 123: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:15,183 INFO L290 TraceCheckUtils]: 122: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:15,183 INFO L290 TraceCheckUtils]: 121: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:15,183 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {26291#true} {26361#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:15,183 INFO L290 TraceCheckUtils]: 119: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:15,184 INFO L290 TraceCheckUtils]: 118: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:15,184 INFO L290 TraceCheckUtils]: 117: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:15,184 INFO L272 TraceCheckUtils]: 116: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:15,184 INFO L290 TraceCheckUtils]: 115: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:15,184 INFO L290 TraceCheckUtils]: 114: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:15,185 INFO L290 TraceCheckUtils]: 113: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:15,185 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {26291#true} {26356#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:15,185 INFO L290 TraceCheckUtils]: 111: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:15,185 INFO L290 TraceCheckUtils]: 110: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:15,185 INFO L290 TraceCheckUtils]: 109: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:15,185 INFO L272 TraceCheckUtils]: 108: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:15,186 INFO L290 TraceCheckUtils]: 107: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:15,186 INFO L290 TraceCheckUtils]: 106: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:15,186 INFO L290 TraceCheckUtils]: 105: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:15,187 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26291#true} {26351#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:15,187 INFO L290 TraceCheckUtils]: 103: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:15,187 INFO L290 TraceCheckUtils]: 102: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:15,187 INFO L290 TraceCheckUtils]: 101: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:15,187 INFO L272 TraceCheckUtils]: 100: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:15,187 INFO L290 TraceCheckUtils]: 99: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:15,188 INFO L290 TraceCheckUtils]: 98: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:15,188 INFO L290 TraceCheckUtils]: 97: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:15,188 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {26291#true} {26346#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:15,188 INFO L290 TraceCheckUtils]: 95: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:15,188 INFO L290 TraceCheckUtils]: 94: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:15,189 INFO L290 TraceCheckUtils]: 93: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:15,189 INFO L272 TraceCheckUtils]: 92: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:15,189 INFO L290 TraceCheckUtils]: 91: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:15,189 INFO L290 TraceCheckUtils]: 90: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:15,190 INFO L290 TraceCheckUtils]: 89: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:15,190 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {26291#true} {26341#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:15,190 INFO L290 TraceCheckUtils]: 87: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:15,190 INFO L290 TraceCheckUtils]: 86: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:15,190 INFO L290 TraceCheckUtils]: 85: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:15,190 INFO L272 TraceCheckUtils]: 84: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:15,191 INFO L290 TraceCheckUtils]: 83: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:15,191 INFO L290 TraceCheckUtils]: 82: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:15,191 INFO L290 TraceCheckUtils]: 81: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:15,192 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {26291#true} {26336#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:15,192 INFO L290 TraceCheckUtils]: 79: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:15,192 INFO L290 TraceCheckUtils]: 78: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:15,192 INFO L290 TraceCheckUtils]: 77: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:15,192 INFO L272 TraceCheckUtils]: 76: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:15,192 INFO L290 TraceCheckUtils]: 75: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:15,193 INFO L290 TraceCheckUtils]: 74: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:15,193 INFO L290 TraceCheckUtils]: 73: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:15,193 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {26291#true} {26331#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:15,193 INFO L290 TraceCheckUtils]: 71: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:15,193 INFO L290 TraceCheckUtils]: 70: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:15,193 INFO L290 TraceCheckUtils]: 69: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:15,194 INFO L272 TraceCheckUtils]: 68: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:15,194 INFO L290 TraceCheckUtils]: 67: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:15,194 INFO L290 TraceCheckUtils]: 66: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:15,195 INFO L290 TraceCheckUtils]: 65: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:15,195 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {26291#true} {26326#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:15,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:15,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:15,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:15,195 INFO L272 TraceCheckUtils]: 60: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:15,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:15,196 INFO L290 TraceCheckUtils]: 58: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:15,196 INFO L290 TraceCheckUtils]: 57: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:15,197 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {26291#true} {26321#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:15,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:15,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:15,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:15,197 INFO L272 TraceCheckUtils]: 52: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:15,197 INFO L290 TraceCheckUtils]: 51: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:15,197 INFO L290 TraceCheckUtils]: 50: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:15,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:15,198 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {26291#true} {26316#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:15,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:15,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:15,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:15,198 INFO L272 TraceCheckUtils]: 44: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:15,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:15,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {27128#(<= main_~n~0 (+ main_~i~1 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:15,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {27128#(<= main_~n~0 (+ main_~i~1 13))} havoc #t~mem5; {27128#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-08 04:07:15,200 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {26291#true} {27128#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {27128#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-08 04:07:15,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:15,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-08 04:07:15,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-08 04:07:15,200 INFO L272 TraceCheckUtils]: 36: Hoare triple {27128#(<= main_~n~0 (+ main_~i~1 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-08 04:07:15,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {27128#(<= main_~n~0 (+ main_~i~1 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {27128#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-08 04:07:15,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {26310#(<= main_~n~0 13)} ~i~1 := 0; {27128#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-08 04:07:15,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {26309#(<= main_~i~0 13)} assume !(~i~0 < ~n~0); {26310#(<= main_~n~0 13)} is VALID [2022-04-08 04:07:15,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {26308#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26309#(<= main_~i~0 13)} is VALID [2022-04-08 04:07:15,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {26308#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26308#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:15,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {26307#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26308#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:15,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {26307#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26307#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:15,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {26306#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26307#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:15,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {26306#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26306#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:15,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {26305#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26306#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:15,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {26305#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26305#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:15,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {26304#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26305#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:15,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {26304#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26304#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:15,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {26303#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26304#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:15,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {26303#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26303#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:15,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {26302#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26303#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:15,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {26302#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26302#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:15,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {26301#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26302#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:15,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {26301#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26301#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:15,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {26300#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26301#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:15,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {26300#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26300#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:15,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {26299#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26300#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:15,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {26299#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26299#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:15,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {26298#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26299#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:15,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {26298#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26298#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:15,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {26297#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26298#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:15,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {26297#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26297#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:15,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {26399#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26297#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:15,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {26399#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26399#(<= main_~i~0 0)} is VALID [2022-04-08 04:07:15,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {26291#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {26399#(<= main_~i~0 0)} is VALID [2022-04-08 04:07:15,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {26291#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26291#true} is VALID [2022-04-08 04:07:15,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {26291#true} call #t~ret6 := main(); {26291#true} is VALID [2022-04-08 04:07:15,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26291#true} #70#return; {26291#true} is VALID [2022-04-08 04:07:15,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-08 04:07:15,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#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(9, 2); {26291#true} is VALID [2022-04-08 04:07:15,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {26291#true} call ULTIMATE.init(); {26291#true} is VALID [2022-04-08 04:07:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 364 proven. 169 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 04:07:15,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860556466] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:07:15,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 04:07:15,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 48 [2022-04-08 04:07:15,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:07:15,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [852789716] [2022-04-08 04:07:15,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [852789716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:07:15,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:07:15,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-08 04:07:15,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824628052] [2022-04-08 04:07:15,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:07:15,229 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 144 [2022-04-08 04:07:15,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:07:15,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:07:15,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:07:15,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-08 04:07:15,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:07:15,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-08 04:07:15,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=1754, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 04:07:15,298 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:07:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:16,685 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2022-04-08 04:07:16,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 04:07:16,685 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 144 [2022-04-08 04:07:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:07:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:07:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 127 transitions. [2022-04-08 04:07:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:07:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 127 transitions. [2022-04-08 04:07:16,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 127 transitions. [2022-04-08 04:07:16,793 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-08 04:07:16,795 INFO L225 Difference]: With dead ends: 214 [2022-04-08 04:07:16,795 INFO L226 Difference]: Without dead ends: 150 [2022-04-08 04:07:16,796 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1030, Invalid=4822, Unknown=0, NotChecked=0, Total=5852 [2022-04-08 04:07:16,797 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:07:16,797 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 66 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 04:07:16,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-08 04:07:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-08 04:07:16,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:07:16,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 04:07:16,994 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 04:07:16,994 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 04:07:16,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:16,996 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-08 04:07:16,996 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-08 04:07:16,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:07:16,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:07:16,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 150 states. [2022-04-08 04:07:16,997 INFO L87 Difference]: Start difference. First operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 150 states. [2022-04-08 04:07:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:16,999 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-08 04:07:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-08 04:07:16,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:07:16,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:07:16,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:07:16,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:07:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 04:07:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2022-04-08 04:07:17,001 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 144 [2022-04-08 04:07:17,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:07:17,002 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2022-04-08 04:07:17,002 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:07:17,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 150 transitions. [2022-04-08 04:07:17,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:07:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2022-04-08 04:07:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-08 04:07:17,243 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:07:17,243 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:07:17,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-08 04:07:17,443 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,SelfDestructingSolverStorable26 [2022-04-08 04:07:17,444 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:07:17,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:07:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash 564353732, now seen corresponding path program 51 times [2022-04-08 04:07:17,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:07:17,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [891458612] [2022-04-08 04:07:17,446 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:07:17,446 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:07:17,446 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:07:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash 564353732, now seen corresponding path program 52 times [2022-04-08 04:07:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:07:17,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991959351] [2022-04-08 04:07:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:07:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:07:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:07:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {28431#(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(9, 2); {28341#true} is VALID [2022-04-08 04:07:18,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28341#true} {28341#true} #70#return; {28341#true} is VALID [2022-04-08 04:07:18,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 04:07:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} #68#return; {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:07:18,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-08 04:07:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #68#return; {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-08 04:07:18,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-08 04:07:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-08 04:07:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-08 04:07:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:07:18,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-08 04:07:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-08 04:07:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:07:18,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-08 04:07:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:07:18,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-08 04:07:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:07:18,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-08 04:07:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-04-08 04:07:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:07:18,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-04-08 04:07:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:07:18,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-08 04:07:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:07:18,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {28341#true} call ULTIMATE.init(); {28431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:07:18,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {28431#(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(9, 2); {28341#true} is VALID [2022-04-08 04:07:18,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28341#true} #70#return; {28341#true} is VALID [2022-04-08 04:07:18,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {28341#true} call #t~ret6 := main(); {28341#true} is VALID [2022-04-08 04:07:18,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {28341#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {28341#true} is VALID [2022-04-08 04:07:18,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {28341#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {28346#(= main_~i~0 0)} is VALID [2022-04-08 04:07:18,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {28346#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28346#(= main_~i~0 0)} is VALID [2022-04-08 04:07:18,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {28346#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28347#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:07:18,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {28347#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28347#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:07:18,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {28347#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28348#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:07:18,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {28348#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28348#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:07:18,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {28348#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28349#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:07:18,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {28349#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28349#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:07:18,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {28349#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28350#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:07:18,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {28350#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28350#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:07:18,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {28350#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28351#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:07:18,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {28351#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28351#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:07:18,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {28351#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28352#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:07:18,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {28352#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28352#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:07:18,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {28352#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28353#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:07:18,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {28353#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28353#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:07:18,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {28353#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28354#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:07:18,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {28354#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28354#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:07:18,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {28354#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28355#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:07:18,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {28355#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28355#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:07:18,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {28355#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28356#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-08 04:07:18,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {28356#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28356#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-08 04:07:18,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {28356#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28357#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-08 04:07:18,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {28357#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28357#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-08 04:07:18,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {28357#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28358#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-08 04:07:18,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {28358#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28358#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-08 04:07:18,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {28358#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28359#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-08 04:07:18,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {28359#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28360#(and (<= main_~i~0 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 13 main_~i~0))} is VALID [2022-04-08 04:07:18,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {28360#(and (<= main_~i~0 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 13 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28361#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0)} is VALID [2022-04-08 04:07:18,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {28361#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0)} assume !(~i~0 < ~n~0); {28361#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0)} is VALID [2022-04-08 04:07:18,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {28361#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0)} ~i~1 := 0; {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:07:18,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:07:18,130 INFO L272 TraceCheckUtils]: 38: Hoare triple {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-08 04:07:18,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,131 INFO L290 TraceCheckUtils]: 41: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,131 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {28341#true} {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} #68#return; {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:07:18,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} havoc #t~mem5; {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:07:18,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-08 04:07:18,132 INFO L290 TraceCheckUtils]: 45: Hoare triple {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-08 04:07:18,132 INFO L272 TraceCheckUtils]: 46: Hoare triple {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-08 04:07:18,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,133 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {28341#true} {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #68#return; {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-08 04:07:18,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} havoc #t~mem5; {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-08 04:07:18,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,134 INFO L272 TraceCheckUtils]: 54: Hoare triple {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-08 04:07:18,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,134 INFO L290 TraceCheckUtils]: 56: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,134 INFO L290 TraceCheckUtils]: 57: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,135 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {28341#true} {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,135 INFO L290 TraceCheckUtils]: 59: Hoare triple {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} havoc #t~mem5; {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,135 INFO L290 TraceCheckUtils]: 60: Hoare triple {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,136 INFO L290 TraceCheckUtils]: 61: Hoare triple {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,136 INFO L272 TraceCheckUtils]: 62: Hoare triple {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-08 04:07:18,136 INFO L290 TraceCheckUtils]: 63: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,136 INFO L290 TraceCheckUtils]: 64: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,136 INFO L290 TraceCheckUtils]: 65: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,136 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {28341#true} {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,137 INFO L290 TraceCheckUtils]: 67: Hoare triple {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} havoc #t~mem5; {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,137 INFO L290 TraceCheckUtils]: 68: Hoare triple {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:07:18,138 INFO L290 TraceCheckUtils]: 69: Hoare triple {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:07:18,138 INFO L272 TraceCheckUtils]: 70: Hoare triple {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-08 04:07:18,138 INFO L290 TraceCheckUtils]: 71: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,138 INFO L290 TraceCheckUtils]: 72: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,138 INFO L290 TraceCheckUtils]: 73: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,138 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {28341#true} {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:07:18,139 INFO L290 TraceCheckUtils]: 75: Hoare triple {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:07:18,139 INFO L290 TraceCheckUtils]: 76: Hoare triple {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,139 INFO L290 TraceCheckUtils]: 77: Hoare triple {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,140 INFO L272 TraceCheckUtils]: 78: Hoare triple {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-08 04:07:18,140 INFO L290 TraceCheckUtils]: 79: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,140 INFO L290 TraceCheckUtils]: 80: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,140 INFO L290 TraceCheckUtils]: 81: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,140 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {28341#true} {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,140 INFO L290 TraceCheckUtils]: 83: Hoare triple {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,141 INFO L290 TraceCheckUtils]: 84: Hoare triple {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:07:18,141 INFO L290 TraceCheckUtils]: 85: Hoare triple {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:07:18,141 INFO L272 TraceCheckUtils]: 86: Hoare triple {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-08 04:07:18,141 INFO L290 TraceCheckUtils]: 87: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,141 INFO L290 TraceCheckUtils]: 88: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,142 INFO L290 TraceCheckUtils]: 89: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,142 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {28341#true} {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:07:18,142 INFO L290 TraceCheckUtils]: 91: Hoare triple {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:07:18,143 INFO L290 TraceCheckUtils]: 92: Hoare triple {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:07:18,143 INFO L290 TraceCheckUtils]: 93: Hoare triple {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:07:18,143 INFO L272 TraceCheckUtils]: 94: Hoare triple {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-08 04:07:18,143 INFO L290 TraceCheckUtils]: 95: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,143 INFO L290 TraceCheckUtils]: 96: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,143 INFO L290 TraceCheckUtils]: 97: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,144 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {28341#true} {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:07:18,144 INFO L290 TraceCheckUtils]: 99: Hoare triple {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:07:18,144 INFO L290 TraceCheckUtils]: 100: Hoare triple {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:07:18,145 INFO L290 TraceCheckUtils]: 101: Hoare triple {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:07:18,145 INFO L272 TraceCheckUtils]: 102: Hoare triple {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-08 04:07:18,145 INFO L290 TraceCheckUtils]: 103: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,145 INFO L290 TraceCheckUtils]: 104: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,145 INFO L290 TraceCheckUtils]: 105: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,145 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {28341#true} {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:07:18,146 INFO L290 TraceCheckUtils]: 107: Hoare triple {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:07:18,146 INFO L290 TraceCheckUtils]: 108: Hoare triple {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,146 INFO L290 TraceCheckUtils]: 109: Hoare triple {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,146 INFO L272 TraceCheckUtils]: 110: Hoare triple {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-08 04:07:18,146 INFO L290 TraceCheckUtils]: 111: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,147 INFO L290 TraceCheckUtils]: 112: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,147 INFO L290 TraceCheckUtils]: 113: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,147 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {28341#true} {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,147 INFO L290 TraceCheckUtils]: 115: Hoare triple {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,148 INFO L290 TraceCheckUtils]: 116: Hoare triple {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:07:18,148 INFO L290 TraceCheckUtils]: 117: Hoare triple {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:07:18,148 INFO L272 TraceCheckUtils]: 118: Hoare triple {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-08 04:07:18,148 INFO L290 TraceCheckUtils]: 119: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,148 INFO L290 TraceCheckUtils]: 120: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,148 INFO L290 TraceCheckUtils]: 121: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,149 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {28341#true} {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:07:18,149 INFO L290 TraceCheckUtils]: 123: Hoare triple {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:07:18,149 INFO L290 TraceCheckUtils]: 124: Hoare triple {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:07:18,150 INFO L290 TraceCheckUtils]: 125: Hoare triple {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:07:18,150 INFO L272 TraceCheckUtils]: 126: Hoare triple {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-08 04:07:18,150 INFO L290 TraceCheckUtils]: 127: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,150 INFO L290 TraceCheckUtils]: 128: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,150 INFO L290 TraceCheckUtils]: 129: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,150 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {28341#true} {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:07:18,151 INFO L290 TraceCheckUtils]: 131: Hoare triple {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:07:18,151 INFO L290 TraceCheckUtils]: 132: Hoare triple {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:07:18,152 INFO L290 TraceCheckUtils]: 133: Hoare triple {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:07:18,152 INFO L272 TraceCheckUtils]: 134: Hoare triple {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-08 04:07:18,152 INFO L290 TraceCheckUtils]: 135: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-08 04:07:18,152 INFO L290 TraceCheckUtils]: 136: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-08 04:07:18,152 INFO L290 TraceCheckUtils]: 137: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:18,152 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {28341#true} {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:07:18,153 INFO L290 TraceCheckUtils]: 139: Hoare triple {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:07:18,153 INFO L290 TraceCheckUtils]: 140: Hoare triple {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28427#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:18,153 INFO L290 TraceCheckUtils]: 141: Hoare triple {28427#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28428#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:07:18,154 INFO L272 TraceCheckUtils]: 142: Hoare triple {28428#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28429#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:07:18,154 INFO L290 TraceCheckUtils]: 143: Hoare triple {28429#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {28430#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:07:18,154 INFO L290 TraceCheckUtils]: 144: Hoare triple {28430#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28342#false} is VALID [2022-04-08 04:07:18,154 INFO L290 TraceCheckUtils]: 145: Hoare triple {28342#false} assume !false; {28342#false} is VALID [2022-04-08 04:07:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 26 proven. 534 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 04:07:18,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:07:18,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991959351] [2022-04-08 04:07:18,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991959351] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:07:18,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067156267] [2022-04-08 04:07:18,155 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:07:18,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:07:18,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:07:18,176 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-08 04:07:18,177 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-08 04:07:18,535 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:07:18,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:07:18,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 04:07:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:18,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:07:19,069 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-08 04:07:32,381 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-08 04:07:32,381 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 23 treesize of output 10 [2022-04-08 04:07:32,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {28341#true} call ULTIMATE.init(); {28341#true} is VALID [2022-04-08 04:07:32,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#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(9, 2); {28341#true} is VALID [2022-04-08 04:07:32,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-08 04:07:32,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28341#true} #70#return; {28341#true} is VALID [2022-04-08 04:07:32,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {28341#true} call #t~ret6 := main(); {28341#true} is VALID [2022-04-08 04:07:32,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {28341#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {28341#true} is VALID [2022-04-08 04:07:32,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {28341#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {28453#(<= main_~i~0 0)} is VALID [2022-04-08 04:07:32,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {28453#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28453#(<= main_~i~0 0)} is VALID [2022-04-08 04:07:32,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {28453#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28460#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:32,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {28460#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28460#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:32,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {28460#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28467#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:32,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {28467#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28467#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:32,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {28467#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28474#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:32,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {28474#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28474#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:32,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {28474#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28481#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:32,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {28481#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28481#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:32,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {28481#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28488#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:32,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {28488#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28488#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:32,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {28488#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28495#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:32,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {28495#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28495#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:32,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {28495#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28502#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:32,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {28502#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28502#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:32,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {28502#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28509#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:32,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {28509#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28509#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:32,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {28509#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28516#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:32,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {28516#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28516#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:32,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {28516#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28523#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:32,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {28523#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28523#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:32,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {28523#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28530#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:32,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {28530#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28530#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:32,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {28530#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28537#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:32,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {28537#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28537#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:32,501 INFO L290 TraceCheckUtils]: 32: Hoare triple {28537#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28544#(<= main_~i~0 13)} is VALID [2022-04-08 04:07:32,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {28544#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28548#(and (<= main_~i~0 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-08 04:07:32,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {28548#(and (<= main_~i~0 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28552#(exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (<= main_~i~0 (+ v_main_~i~0_381 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0)))} is VALID [2022-04-08 04:07:32,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {28552#(exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (<= main_~i~0 (+ v_main_~i~0_381 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0)))} assume !(~i~0 < ~n~0); {28556#(exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1))))} is VALID [2022-04-08 04:07:32,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {28556#(exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1))))} ~i~1 := 0; {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,506 INFO L272 TraceCheckUtils]: 38: Hoare triple {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,508 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #68#return; {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,508 INFO L290 TraceCheckUtils]: 43: Hoare triple {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} havoc #t~mem5; {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,509 INFO L290 TraceCheckUtils]: 45: Hoare triple {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,510 INFO L272 TraceCheckUtils]: 46: Hoare triple {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,512 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #68#return; {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,512 INFO L290 TraceCheckUtils]: 51: Hoare triple {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} havoc #t~mem5; {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,513 INFO L290 TraceCheckUtils]: 52: Hoare triple {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:07:32,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:07:32,515 INFO L272 TraceCheckUtils]: 54: Hoare triple {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,516 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} #68#return; {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:07:32,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} havoc #t~mem5; {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} is VALID [2022-04-08 04:07:32,517 INFO L290 TraceCheckUtils]: 60: Hoare triple {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:07:32,517 INFO L290 TraceCheckUtils]: 61: Hoare triple {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:07:32,518 INFO L272 TraceCheckUtils]: 62: Hoare triple {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,518 INFO L290 TraceCheckUtils]: 63: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,519 INFO L290 TraceCheckUtils]: 64: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,519 INFO L290 TraceCheckUtils]: 65: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,520 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} #68#return; {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:07:32,520 INFO L290 TraceCheckUtils]: 67: Hoare triple {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} havoc #t~mem5; {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} is VALID [2022-04-08 04:07:32,521 INFO L290 TraceCheckUtils]: 68: Hoare triple {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:07:32,521 INFO L290 TraceCheckUtils]: 69: Hoare triple {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:07:32,522 INFO L272 TraceCheckUtils]: 70: Hoare triple {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,523 INFO L290 TraceCheckUtils]: 71: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,523 INFO L290 TraceCheckUtils]: 72: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,523 INFO L290 TraceCheckUtils]: 73: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,524 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} #68#return; {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:07:32,524 INFO L290 TraceCheckUtils]: 75: Hoare triple {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} havoc #t~mem5; {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} is VALID [2022-04-08 04:07:32,525 INFO L290 TraceCheckUtils]: 76: Hoare triple {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} is VALID [2022-04-08 04:07:32,525 INFO L290 TraceCheckUtils]: 77: Hoare triple {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} is VALID [2022-04-08 04:07:32,526 INFO L272 TraceCheckUtils]: 78: Hoare triple {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,527 INFO L290 TraceCheckUtils]: 79: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,527 INFO L290 TraceCheckUtils]: 80: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,527 INFO L290 TraceCheckUtils]: 81: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,528 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} #68#return; {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} is VALID [2022-04-08 04:07:32,528 INFO L290 TraceCheckUtils]: 83: Hoare triple {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} havoc #t~mem5; {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} is VALID [2022-04-08 04:07:32,529 INFO L290 TraceCheckUtils]: 84: Hoare triple {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,529 INFO L290 TraceCheckUtils]: 85: Hoare triple {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,530 INFO L272 TraceCheckUtils]: 86: Hoare triple {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,531 INFO L290 TraceCheckUtils]: 87: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,531 INFO L290 TraceCheckUtils]: 88: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,531 INFO L290 TraceCheckUtils]: 89: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,532 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #68#return; {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,532 INFO L290 TraceCheckUtils]: 91: Hoare triple {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} havoc #t~mem5; {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,533 INFO L290 TraceCheckUtils]: 92: Hoare triple {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} is VALID [2022-04-08 04:07:32,534 INFO L290 TraceCheckUtils]: 93: Hoare triple {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} is VALID [2022-04-08 04:07:32,535 INFO L272 TraceCheckUtils]: 94: Hoare triple {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,535 INFO L290 TraceCheckUtils]: 95: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,535 INFO L290 TraceCheckUtils]: 96: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,535 INFO L290 TraceCheckUtils]: 97: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,536 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} #68#return; {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} is VALID [2022-04-08 04:07:32,537 INFO L290 TraceCheckUtils]: 99: Hoare triple {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} havoc #t~mem5; {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} is VALID [2022-04-08 04:07:32,537 INFO L290 TraceCheckUtils]: 100: Hoare triple {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} is VALID [2022-04-08 04:07:32,538 INFO L290 TraceCheckUtils]: 101: Hoare triple {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} is VALID [2022-04-08 04:07:32,539 INFO L272 TraceCheckUtils]: 102: Hoare triple {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,539 INFO L290 TraceCheckUtils]: 103: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,539 INFO L290 TraceCheckUtils]: 104: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,539 INFO L290 TraceCheckUtils]: 105: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,540 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} #68#return; {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} is VALID [2022-04-08 04:07:32,540 INFO L290 TraceCheckUtils]: 107: Hoare triple {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} havoc #t~mem5; {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} is VALID [2022-04-08 04:07:32,541 INFO L290 TraceCheckUtils]: 108: Hoare triple {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} is VALID [2022-04-08 04:07:32,541 INFO L290 TraceCheckUtils]: 109: Hoare triple {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} is VALID [2022-04-08 04:07:32,542 INFO L272 TraceCheckUtils]: 110: Hoare triple {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,542 INFO L290 TraceCheckUtils]: 111: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,543 INFO L290 TraceCheckUtils]: 112: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,543 INFO L290 TraceCheckUtils]: 113: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,544 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} #68#return; {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} is VALID [2022-04-08 04:07:32,544 INFO L290 TraceCheckUtils]: 115: Hoare triple {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} havoc #t~mem5; {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} is VALID [2022-04-08 04:07:32,544 INFO L290 TraceCheckUtils]: 116: Hoare triple {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,545 INFO L290 TraceCheckUtils]: 117: Hoare triple {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,546 INFO L272 TraceCheckUtils]: 118: Hoare triple {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28818#(exists ((v_main_~i~0_381 Int) (v_main_~x~0.base_BEFORE_CALL_108 Int) (v_main_~x~0.offset_BEFORE_CALL_108 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_108) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_108)) 0) (<= v_main_~i~0_381 13)))} is VALID [2022-04-08 04:07:32,546 INFO L290 TraceCheckUtils]: 119: Hoare triple {28818#(exists ((v_main_~i~0_381 Int) (v_main_~x~0.base_BEFORE_CALL_108 Int) (v_main_~x~0.offset_BEFORE_CALL_108 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_108) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_108)) 0) (<= v_main_~i~0_381 13)))} ~cond := #in~cond; {28818#(exists ((v_main_~i~0_381 Int) (v_main_~x~0.base_BEFORE_CALL_108 Int) (v_main_~x~0.offset_BEFORE_CALL_108 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_108) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_108)) 0) (<= v_main_~i~0_381 13)))} is VALID [2022-04-08 04:07:32,547 INFO L290 TraceCheckUtils]: 120: Hoare triple {28818#(exists ((v_main_~i~0_381 Int) (v_main_~x~0.base_BEFORE_CALL_108 Int) (v_main_~x~0.offset_BEFORE_CALL_108 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_108) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_108)) 0) (<= v_main_~i~0_381 13)))} assume !(0 == ~cond); {28818#(exists ((v_main_~i~0_381 Int) (v_main_~x~0.base_BEFORE_CALL_108 Int) (v_main_~x~0.offset_BEFORE_CALL_108 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_108) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_108)) 0) (<= v_main_~i~0_381 13)))} is VALID [2022-04-08 04:07:32,547 INFO L290 TraceCheckUtils]: 121: Hoare triple {28818#(exists ((v_main_~i~0_381 Int) (v_main_~x~0.base_BEFORE_CALL_108 Int) (v_main_~x~0.offset_BEFORE_CALL_108 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_108) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_108)) 0) (<= v_main_~i~0_381 13)))} assume true; {28818#(exists ((v_main_~i~0_381 Int) (v_main_~x~0.base_BEFORE_CALL_108 Int) (v_main_~x~0.offset_BEFORE_CALL_108 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_108) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_108)) 0) (<= v_main_~i~0_381 13)))} is VALID [2022-04-08 04:07:32,548 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {28818#(exists ((v_main_~i~0_381 Int) (v_main_~x~0.base_BEFORE_CALL_108 Int) (v_main_~x~0.offset_BEFORE_CALL_108 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_108) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_108)) 0) (<= v_main_~i~0_381 13)))} {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #68#return; {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,548 INFO L290 TraceCheckUtils]: 123: Hoare triple {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} havoc #t~mem5; {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,549 INFO L290 TraceCheckUtils]: 124: Hoare triple {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28837#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,549 INFO L290 TraceCheckUtils]: 125: Hoare triple {28837#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28837#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,550 INFO L272 TraceCheckUtils]: 126: Hoare triple {28837#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,550 INFO L290 TraceCheckUtils]: 127: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,551 INFO L290 TraceCheckUtils]: 128: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,551 INFO L290 TraceCheckUtils]: 129: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,551 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28837#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #68#return; {28837#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,552 INFO L290 TraceCheckUtils]: 131: Hoare triple {28837#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} havoc #t~mem5; {28837#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,552 INFO L290 TraceCheckUtils]: 132: Hoare triple {28837#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28862#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} is VALID [2022-04-08 04:07:32,553 INFO L290 TraceCheckUtils]: 133: Hoare triple {28862#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28862#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} is VALID [2022-04-08 04:07:32,554 INFO L272 TraceCheckUtils]: 134: Hoare triple {28862#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,554 INFO L290 TraceCheckUtils]: 135: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,554 INFO L290 TraceCheckUtils]: 136: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,554 INFO L290 TraceCheckUtils]: 137: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-08 04:07:32,555 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28862#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} #68#return; {28862#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} is VALID [2022-04-08 04:07:32,555 INFO L290 TraceCheckUtils]: 139: Hoare triple {28862#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} havoc #t~mem5; {28862#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} is VALID [2022-04-08 04:07:32,556 INFO L290 TraceCheckUtils]: 140: Hoare triple {28862#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28887#(and (<= 13 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-08 04:07:32,557 INFO L290 TraceCheckUtils]: 141: Hoare triple {28887#(and (<= 13 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28428#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:07:32,557 INFO L272 TraceCheckUtils]: 142: Hoare triple {28428#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:07:32,557 INFO L290 TraceCheckUtils]: 143: Hoare triple {28894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:07:32,558 INFO L290 TraceCheckUtils]: 144: Hoare triple {28898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28342#false} is VALID [2022-04-08 04:07:32,558 INFO L290 TraceCheckUtils]: 145: Hoare triple {28342#false} assume !false; {28342#false} is VALID [2022-04-08 04:07:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 365 proven. 235 refuted. 8 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 04:07:32,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:07:32,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067156267] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:07:32,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:07:32,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38] total 71 [2022-04-08 04:07:32,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:07:32,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [891458612] [2022-04-08 04:07:32,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [891458612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:07:32,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:07:32,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-08 04:07:32,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249406143] [2022-04-08 04:07:32,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:07:32,868 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 146 [2022-04-08 04:07:32,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:07:32,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:07:32,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:07:32,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-08 04:07:32,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:07:32,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-08 04:07:32,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=4730, Unknown=1, NotChecked=0, Total=5256 [2022-04-08 04:07:32,939 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:07:39,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:39,298 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2022-04-08 04:07:39,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 04:07:39,298 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 146 [2022-04-08 04:07:39,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:07:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:07:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 124 transitions. [2022-04-08 04:07:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:07:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 124 transitions. [2022-04-08 04:07:39,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 124 transitions. [2022-04-08 04:07:39,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:07:39,420 INFO L225 Difference]: With dead ends: 162 [2022-04-08 04:07:39,420 INFO L226 Difference]: Without dead ends: 160 [2022-04-08 04:07:39,421 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 120 SyntacticMatches, 25 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2531 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=844, Invalid=10497, Unknown=1, NotChecked=0, Total=11342 [2022-04-08 04:07:39,422 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 95 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 3578 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-08 04:07:39,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 190 Invalid, 3672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3578 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-08 04:07:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-08 04:07:39,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2022-04-08 04:07:39,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:07:39,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:07:39,626 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:07:39,626 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:07:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:39,628 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-08 04:07:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-08 04:07:39,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:07:39,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:07:39,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 160 states. [2022-04-08 04:07:39,629 INFO L87 Difference]: Start difference. First operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 160 states. [2022-04-08 04:07:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:39,631 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-08 04:07:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-08 04:07:39,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:07:39,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:07:39,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:07:39,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:07:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:07:39,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2022-04-08 04:07:39,634 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 146 [2022-04-08 04:07:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:07:39,634 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2022-04-08 04:07:39,634 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:07:39,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 158 transitions. [2022-04-08 04:07:39,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:07:39,887 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2022-04-08 04:07:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-08 04:07:39,887 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:07:39,887 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:07:39,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-08 04:07:40,105 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,SelfDestructingSolverStorable27 [2022-04-08 04:07:40,106 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:07:40,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:07:40,106 INFO L85 PathProgramCache]: Analyzing trace with hash -696599394, now seen corresponding path program 53 times [2022-04-08 04:07:40,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:07:40,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1809725497] [2022-04-08 04:07:40,108 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:07:40,108 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:07:40,108 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:07:40,108 INFO L85 PathProgramCache]: Analyzing trace with hash -696599394, now seen corresponding path program 54 times [2022-04-08 04:07:40,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:07:40,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656486863] [2022-04-08 04:07:40,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:07:40,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:07:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:07:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {30048#(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(9, 2); {29956#true} is VALID [2022-04-08 04:07:40,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,499 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29956#true} {29956#true} #70#return; {29956#true} is VALID [2022-04-08 04:07:40,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-08 04:07:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} #68#return; {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:40,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-08 04:07:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29982#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-08 04:07:40,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-08 04:07:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29987#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:40,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-08 04:07:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29992#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:40,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-08 04:07:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29997#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:40,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-08 04:07:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30002#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:40,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-08 04:07:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30007#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:40,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-08 04:07:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30012#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:40,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-08 04:07:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30017#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:40,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-08 04:07:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30022#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:40,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-04-08 04:07:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30027#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:40,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-04-08 04:07:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30032#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:40,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-08 04:07:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30037#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:40,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-04-08 04:07:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30042#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:40,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {29956#true} call ULTIMATE.init(); {30048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:07:40,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {30048#(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(9, 2); {29956#true} is VALID [2022-04-08 04:07:40,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29956#true} #70#return; {29956#true} is VALID [2022-04-08 04:07:40,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {29956#true} call #t~ret6 := main(); {29956#true} is VALID [2022-04-08 04:07:40,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {29956#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29956#true} is VALID [2022-04-08 04:07:40,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {29956#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {29961#(= main_~i~0 0)} is VALID [2022-04-08 04:07:40,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {29961#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29961#(= main_~i~0 0)} is VALID [2022-04-08 04:07:40,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {29961#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29962#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:40,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {29962#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29962#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:40,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {29962#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29963#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:40,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {29963#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29963#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:40,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {29963#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29964#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:40,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {29964#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29964#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:40,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {29964#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29965#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:40,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {29965#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29965#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:40,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {29965#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29966#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:40,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {29966#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29966#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:40,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {29966#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29967#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:40,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {29967#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29967#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:40,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {29967#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29968#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:40,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {29968#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29968#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:40,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {29968#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29969#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:40,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {29969#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29969#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:40,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {29969#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29970#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:40,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {29970#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29970#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:40,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {29970#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29971#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:40,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {29971#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29971#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:40,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {29971#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29972#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:40,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {29972#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29972#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:40,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {29972#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29973#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:40,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {29973#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29973#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:40,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {29973#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29974#(<= main_~i~0 13)} is VALID [2022-04-08 04:07:40,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {29974#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29974#(<= main_~i~0 13)} is VALID [2022-04-08 04:07:40,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {29974#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29975#(<= main_~i~0 14)} is VALID [2022-04-08 04:07:40,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {29975#(<= main_~i~0 14)} assume !(~i~0 < ~n~0); {29976#(<= main_~n~0 14)} is VALID [2022-04-08 04:07:40,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {29976#(<= main_~n~0 14)} ~i~1 := 0; {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:40,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:40,551 INFO L272 TraceCheckUtils]: 38: Hoare triple {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:40,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,551 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29956#true} {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} #68#return; {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:40,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} havoc #t~mem5; {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:40,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-08 04:07:40,552 INFO L290 TraceCheckUtils]: 45: Hoare triple {29982#(<= main_~n~0 (+ main_~i~1 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-08 04:07:40,552 INFO L272 TraceCheckUtils]: 46: Hoare triple {29982#(<= main_~n~0 (+ main_~i~1 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:40,552 INFO L290 TraceCheckUtils]: 47: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,553 INFO L290 TraceCheckUtils]: 48: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,553 INFO L290 TraceCheckUtils]: 49: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,553 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29956#true} {29982#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-08 04:07:40,553 INFO L290 TraceCheckUtils]: 51: Hoare triple {29982#(<= main_~n~0 (+ main_~i~1 13))} havoc #t~mem5; {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-08 04:07:40,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {29982#(<= main_~n~0 (+ main_~i~1 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:40,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {29987#(<= main_~n~0 (+ main_~i~1 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:40,554 INFO L272 TraceCheckUtils]: 54: Hoare triple {29987#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:40,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,554 INFO L290 TraceCheckUtils]: 56: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,554 INFO L290 TraceCheckUtils]: 57: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,554 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29956#true} {29987#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:40,555 INFO L290 TraceCheckUtils]: 59: Hoare triple {29987#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:40,555 INFO L290 TraceCheckUtils]: 60: Hoare triple {29987#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:40,555 INFO L290 TraceCheckUtils]: 61: Hoare triple {29992#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:40,555 INFO L272 TraceCheckUtils]: 62: Hoare triple {29992#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:40,556 INFO L290 TraceCheckUtils]: 63: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,556 INFO L290 TraceCheckUtils]: 64: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,556 INFO L290 TraceCheckUtils]: 65: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,556 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29956#true} {29992#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:40,556 INFO L290 TraceCheckUtils]: 67: Hoare triple {29992#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:40,557 INFO L290 TraceCheckUtils]: 68: Hoare triple {29992#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:40,557 INFO L290 TraceCheckUtils]: 69: Hoare triple {29997#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:40,557 INFO L272 TraceCheckUtils]: 70: Hoare triple {29997#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:40,557 INFO L290 TraceCheckUtils]: 71: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,557 INFO L290 TraceCheckUtils]: 72: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,557 INFO L290 TraceCheckUtils]: 73: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,558 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29956#true} {29997#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:40,558 INFO L290 TraceCheckUtils]: 75: Hoare triple {29997#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:40,558 INFO L290 TraceCheckUtils]: 76: Hoare triple {29997#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:40,558 INFO L290 TraceCheckUtils]: 77: Hoare triple {30002#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:40,559 INFO L272 TraceCheckUtils]: 78: Hoare triple {30002#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:40,559 INFO L290 TraceCheckUtils]: 79: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,559 INFO L290 TraceCheckUtils]: 80: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,559 INFO L290 TraceCheckUtils]: 81: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,559 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29956#true} {30002#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:40,559 INFO L290 TraceCheckUtils]: 83: Hoare triple {30002#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:40,560 INFO L290 TraceCheckUtils]: 84: Hoare triple {30002#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:40,560 INFO L290 TraceCheckUtils]: 85: Hoare triple {30007#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:40,560 INFO L272 TraceCheckUtils]: 86: Hoare triple {30007#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:40,560 INFO L290 TraceCheckUtils]: 87: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,560 INFO L290 TraceCheckUtils]: 88: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,560 INFO L290 TraceCheckUtils]: 89: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,561 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29956#true} {30007#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:40,561 INFO L290 TraceCheckUtils]: 91: Hoare triple {30007#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:40,561 INFO L290 TraceCheckUtils]: 92: Hoare triple {30007#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:40,562 INFO L290 TraceCheckUtils]: 93: Hoare triple {30012#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:40,562 INFO L272 TraceCheckUtils]: 94: Hoare triple {30012#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:40,562 INFO L290 TraceCheckUtils]: 95: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,562 INFO L290 TraceCheckUtils]: 96: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,562 INFO L290 TraceCheckUtils]: 97: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,562 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29956#true} {30012#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:40,562 INFO L290 TraceCheckUtils]: 99: Hoare triple {30012#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:40,563 INFO L290 TraceCheckUtils]: 100: Hoare triple {30012#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:40,563 INFO L290 TraceCheckUtils]: 101: Hoare triple {30017#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:40,563 INFO L272 TraceCheckUtils]: 102: Hoare triple {30017#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:40,563 INFO L290 TraceCheckUtils]: 103: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,563 INFO L290 TraceCheckUtils]: 104: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,563 INFO L290 TraceCheckUtils]: 105: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,564 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29956#true} {30017#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:40,564 INFO L290 TraceCheckUtils]: 107: Hoare triple {30017#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:40,564 INFO L290 TraceCheckUtils]: 108: Hoare triple {30017#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:40,565 INFO L290 TraceCheckUtils]: 109: Hoare triple {30022#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:40,565 INFO L272 TraceCheckUtils]: 110: Hoare triple {30022#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:40,565 INFO L290 TraceCheckUtils]: 111: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,565 INFO L290 TraceCheckUtils]: 112: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,565 INFO L290 TraceCheckUtils]: 113: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,565 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29956#true} {30022#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:40,566 INFO L290 TraceCheckUtils]: 115: Hoare triple {30022#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:40,566 INFO L290 TraceCheckUtils]: 116: Hoare triple {30022#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:40,566 INFO L290 TraceCheckUtils]: 117: Hoare triple {30027#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:40,566 INFO L272 TraceCheckUtils]: 118: Hoare triple {30027#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:40,566 INFO L290 TraceCheckUtils]: 119: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,567 INFO L290 TraceCheckUtils]: 120: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,567 INFO L290 TraceCheckUtils]: 121: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,567 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29956#true} {30027#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:40,567 INFO L290 TraceCheckUtils]: 123: Hoare triple {30027#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:40,568 INFO L290 TraceCheckUtils]: 124: Hoare triple {30027#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:40,568 INFO L290 TraceCheckUtils]: 125: Hoare triple {30032#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:40,568 INFO L272 TraceCheckUtils]: 126: Hoare triple {30032#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:40,568 INFO L290 TraceCheckUtils]: 127: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,568 INFO L290 TraceCheckUtils]: 128: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,568 INFO L290 TraceCheckUtils]: 129: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,569 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29956#true} {30032#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:40,569 INFO L290 TraceCheckUtils]: 131: Hoare triple {30032#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:40,569 INFO L290 TraceCheckUtils]: 132: Hoare triple {30032#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:40,570 INFO L290 TraceCheckUtils]: 133: Hoare triple {30037#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:40,570 INFO L272 TraceCheckUtils]: 134: Hoare triple {30037#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:40,570 INFO L290 TraceCheckUtils]: 135: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,570 INFO L290 TraceCheckUtils]: 136: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,570 INFO L290 TraceCheckUtils]: 137: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,570 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29956#true} {30037#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:40,571 INFO L290 TraceCheckUtils]: 139: Hoare triple {30037#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:40,571 INFO L290 TraceCheckUtils]: 140: Hoare triple {30037#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:40,571 INFO L290 TraceCheckUtils]: 141: Hoare triple {30042#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:40,571 INFO L272 TraceCheckUtils]: 142: Hoare triple {30042#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:40,571 INFO L290 TraceCheckUtils]: 143: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:40,571 INFO L290 TraceCheckUtils]: 144: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:40,572 INFO L290 TraceCheckUtils]: 145: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:40,572 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {29956#true} {30042#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:40,572 INFO L290 TraceCheckUtils]: 147: Hoare triple {30042#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:40,573 INFO L290 TraceCheckUtils]: 148: Hoare triple {30042#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30047#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:07:40,573 INFO L290 TraceCheckUtils]: 149: Hoare triple {30047#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29957#false} is VALID [2022-04-08 04:07:40,573 INFO L272 TraceCheckUtils]: 150: Hoare triple {29957#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29957#false} is VALID [2022-04-08 04:07:40,573 INFO L290 TraceCheckUtils]: 151: Hoare triple {29957#false} ~cond := #in~cond; {29957#false} is VALID [2022-04-08 04:07:40,573 INFO L290 TraceCheckUtils]: 152: Hoare triple {29957#false} assume 0 == ~cond; {29957#false} is VALID [2022-04-08 04:07:40,573 INFO L290 TraceCheckUtils]: 153: Hoare triple {29957#false} assume !false; {29957#false} is VALID [2022-04-08 04:07:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 367 proven. 249 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-08 04:07:40,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:07:40,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656486863] [2022-04-08 04:07:40,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656486863] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:07:40,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328209177] [2022-04-08 04:07:40,574 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:07:40,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:07:40,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:07:40,575 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-08 04:07:40,576 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-08 04:07:40,880 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-08 04:07:40,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:07:40,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 04:07:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:40,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:07:42,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {29956#true} call ULTIMATE.init(); {29956#true} is VALID [2022-04-08 04:07:42,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#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(9, 2); {29956#true} is VALID [2022-04-08 04:07:42,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29956#true} #70#return; {29956#true} is VALID [2022-04-08 04:07:42,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {29956#true} call #t~ret6 := main(); {29956#true} is VALID [2022-04-08 04:07:42,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {29956#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29956#true} is VALID [2022-04-08 04:07:42,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {29956#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {30070#(<= main_~i~0 0)} is VALID [2022-04-08 04:07:42,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {30070#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {30070#(<= main_~i~0 0)} is VALID [2022-04-08 04:07:42,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {30070#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29962#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:42,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {29962#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29962#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:42,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {29962#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29963#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:42,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {29963#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29963#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:42,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {29963#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29964#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:42,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {29964#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29964#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:42,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {29964#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29965#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:42,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {29965#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29965#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:42,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {29965#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29966#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:42,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {29966#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29966#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:42,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {29966#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29967#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:42,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {29967#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29967#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:42,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {29967#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29968#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:42,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {29968#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29968#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:42,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {29968#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29969#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:42,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {29969#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29969#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:42,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {29969#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29970#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:42,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {29970#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29970#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:42,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {29970#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29971#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:42,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {29971#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29971#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:42,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {29971#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29972#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:42,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {29972#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29972#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:42,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {29972#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29973#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:42,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {29973#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29973#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:42,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {29973#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29974#(<= main_~i~0 13)} is VALID [2022-04-08 04:07:42,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {29974#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29974#(<= main_~i~0 13)} is VALID [2022-04-08 04:07:42,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {29974#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29975#(<= main_~i~0 14)} is VALID [2022-04-08 04:07:42,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {29975#(<= main_~i~0 14)} assume !(~i~0 < ~n~0); {29976#(<= main_~n~0 14)} is VALID [2022-04-08 04:07:42,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {29976#(<= main_~n~0 14)} ~i~1 := 0; {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,072 INFO L272 TraceCheckUtils]: 38: Hoare triple {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,072 INFO L290 TraceCheckUtils]: 40: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,073 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29956#true} {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} #68#return; {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,073 INFO L290 TraceCheckUtils]: 43: Hoare triple {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,074 INFO L272 TraceCheckUtils]: 46: Hoare triple {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,074 INFO L290 TraceCheckUtils]: 47: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,074 INFO L290 TraceCheckUtils]: 49: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,075 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29956#true} {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} #68#return; {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,075 INFO L290 TraceCheckUtils]: 51: Hoare triple {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,076 INFO L272 TraceCheckUtils]: 54: Hoare triple {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,076 INFO L290 TraceCheckUtils]: 55: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,077 INFO L290 TraceCheckUtils]: 56: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,077 INFO L290 TraceCheckUtils]: 57: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,077 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29956#true} {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} #68#return; {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,077 INFO L290 TraceCheckUtils]: 59: Hoare triple {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,078 INFO L290 TraceCheckUtils]: 60: Hoare triple {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,078 INFO L272 TraceCheckUtils]: 62: Hoare triple {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,078 INFO L290 TraceCheckUtils]: 63: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,078 INFO L290 TraceCheckUtils]: 64: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,079 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29956#true} {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} #68#return; {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,079 INFO L290 TraceCheckUtils]: 67: Hoare triple {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,080 INFO L290 TraceCheckUtils]: 68: Hoare triple {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,080 INFO L290 TraceCheckUtils]: 69: Hoare triple {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,080 INFO L272 TraceCheckUtils]: 70: Hoare triple {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,080 INFO L290 TraceCheckUtils]: 71: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,080 INFO L290 TraceCheckUtils]: 72: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,080 INFO L290 TraceCheckUtils]: 73: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,081 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29956#true} {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} #68#return; {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,081 INFO L290 TraceCheckUtils]: 75: Hoare triple {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,082 INFO L290 TraceCheckUtils]: 76: Hoare triple {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,082 INFO L290 TraceCheckUtils]: 77: Hoare triple {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,082 INFO L272 TraceCheckUtils]: 78: Hoare triple {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,082 INFO L290 TraceCheckUtils]: 79: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,082 INFO L290 TraceCheckUtils]: 80: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,082 INFO L290 TraceCheckUtils]: 81: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,083 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29956#true} {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} #68#return; {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,083 INFO L290 TraceCheckUtils]: 83: Hoare triple {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,083 INFO L290 TraceCheckUtils]: 84: Hoare triple {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,084 INFO L290 TraceCheckUtils]: 85: Hoare triple {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,084 INFO L272 TraceCheckUtils]: 86: Hoare triple {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,084 INFO L290 TraceCheckUtils]: 87: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,084 INFO L290 TraceCheckUtils]: 88: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,084 INFO L290 TraceCheckUtils]: 89: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,085 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29956#true} {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} #68#return; {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,085 INFO L290 TraceCheckUtils]: 91: Hoare triple {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,085 INFO L290 TraceCheckUtils]: 92: Hoare triple {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,086 INFO L290 TraceCheckUtils]: 93: Hoare triple {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,086 INFO L272 TraceCheckUtils]: 94: Hoare triple {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,086 INFO L290 TraceCheckUtils]: 95: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,086 INFO L290 TraceCheckUtils]: 96: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,086 INFO L290 TraceCheckUtils]: 97: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,086 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29956#true} {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} #68#return; {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,087 INFO L290 TraceCheckUtils]: 99: Hoare triple {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,087 INFO L290 TraceCheckUtils]: 100: Hoare triple {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,088 INFO L290 TraceCheckUtils]: 101: Hoare triple {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,088 INFO L272 TraceCheckUtils]: 102: Hoare triple {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,088 INFO L290 TraceCheckUtils]: 103: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,088 INFO L290 TraceCheckUtils]: 104: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,088 INFO L290 TraceCheckUtils]: 105: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,088 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29956#true} {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} #68#return; {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,089 INFO L290 TraceCheckUtils]: 107: Hoare triple {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,089 INFO L290 TraceCheckUtils]: 108: Hoare triple {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,089 INFO L290 TraceCheckUtils]: 109: Hoare triple {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,089 INFO L272 TraceCheckUtils]: 110: Hoare triple {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,090 INFO L290 TraceCheckUtils]: 111: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,090 INFO L290 TraceCheckUtils]: 112: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,090 INFO L290 TraceCheckUtils]: 113: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,090 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29956#true} {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} #68#return; {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,090 INFO L290 TraceCheckUtils]: 115: Hoare triple {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,091 INFO L290 TraceCheckUtils]: 116: Hoare triple {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,091 INFO L290 TraceCheckUtils]: 117: Hoare triple {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,091 INFO L272 TraceCheckUtils]: 118: Hoare triple {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,091 INFO L290 TraceCheckUtils]: 119: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,091 INFO L290 TraceCheckUtils]: 120: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,092 INFO L290 TraceCheckUtils]: 121: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,092 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29956#true} {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} #68#return; {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,092 INFO L290 TraceCheckUtils]: 123: Hoare triple {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,093 INFO L290 TraceCheckUtils]: 124: Hoare triple {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,093 INFO L290 TraceCheckUtils]: 125: Hoare triple {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,093 INFO L272 TraceCheckUtils]: 126: Hoare triple {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,093 INFO L290 TraceCheckUtils]: 127: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,093 INFO L290 TraceCheckUtils]: 128: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,093 INFO L290 TraceCheckUtils]: 129: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,094 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29956#true} {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} #68#return; {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,094 INFO L290 TraceCheckUtils]: 131: Hoare triple {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,095 INFO L290 TraceCheckUtils]: 132: Hoare triple {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,095 INFO L290 TraceCheckUtils]: 133: Hoare triple {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,095 INFO L272 TraceCheckUtils]: 134: Hoare triple {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,095 INFO L290 TraceCheckUtils]: 135: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,095 INFO L290 TraceCheckUtils]: 136: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,095 INFO L290 TraceCheckUtils]: 137: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,096 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29956#true} {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} #68#return; {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,096 INFO L290 TraceCheckUtils]: 139: Hoare triple {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,096 INFO L290 TraceCheckUtils]: 140: Hoare triple {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,097 INFO L290 TraceCheckUtils]: 141: Hoare triple {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,097 INFO L272 TraceCheckUtils]: 142: Hoare triple {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,097 INFO L290 TraceCheckUtils]: 143: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,097 INFO L290 TraceCheckUtils]: 144: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,097 INFO L290 TraceCheckUtils]: 145: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,098 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {29956#true} {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} #68#return; {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,098 INFO L290 TraceCheckUtils]: 147: Hoare triple {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,098 INFO L290 TraceCheckUtils]: 148: Hoare triple {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30511#(and (<= 14 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-08 04:07:42,099 INFO L290 TraceCheckUtils]: 149: Hoare triple {30511#(and (<= 14 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29957#false} is VALID [2022-04-08 04:07:42,099 INFO L272 TraceCheckUtils]: 150: Hoare triple {29957#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29957#false} is VALID [2022-04-08 04:07:42,099 INFO L290 TraceCheckUtils]: 151: Hoare triple {29957#false} ~cond := #in~cond; {29957#false} is VALID [2022-04-08 04:07:42,099 INFO L290 TraceCheckUtils]: 152: Hoare triple {29957#false} assume 0 == ~cond; {29957#false} is VALID [2022-04-08 04:07:42,099 INFO L290 TraceCheckUtils]: 153: Hoare triple {29957#false} assume !false; {29957#false} is VALID [2022-04-08 04:07:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 420 proven. 196 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-08 04:07:42,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:07:42,787 INFO L290 TraceCheckUtils]: 153: Hoare triple {29957#false} assume !false; {29957#false} is VALID [2022-04-08 04:07:42,788 INFO L290 TraceCheckUtils]: 152: Hoare triple {29957#false} assume 0 == ~cond; {29957#false} is VALID [2022-04-08 04:07:42,788 INFO L290 TraceCheckUtils]: 151: Hoare triple {29957#false} ~cond := #in~cond; {29957#false} is VALID [2022-04-08 04:07:42,788 INFO L272 TraceCheckUtils]: 150: Hoare triple {29957#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29957#false} is VALID [2022-04-08 04:07:42,788 INFO L290 TraceCheckUtils]: 149: Hoare triple {30047#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29957#false} is VALID [2022-04-08 04:07:42,788 INFO L290 TraceCheckUtils]: 148: Hoare triple {30042#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30047#(<= main_~n~0 main_~i~1)} is VALID [2022-04-08 04:07:42,789 INFO L290 TraceCheckUtils]: 147: Hoare triple {30042#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:42,789 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {29956#true} {30042#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:42,789 INFO L290 TraceCheckUtils]: 145: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,789 INFO L290 TraceCheckUtils]: 144: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,789 INFO L290 TraceCheckUtils]: 143: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,789 INFO L272 TraceCheckUtils]: 142: Hoare triple {30042#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,790 INFO L290 TraceCheckUtils]: 141: Hoare triple {30042#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:42,790 INFO L290 TraceCheckUtils]: 140: Hoare triple {30037#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-08 04:07:42,790 INFO L290 TraceCheckUtils]: 139: Hoare triple {30037#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:42,791 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29956#true} {30037#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:42,791 INFO L290 TraceCheckUtils]: 137: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,791 INFO L290 TraceCheckUtils]: 136: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,791 INFO L290 TraceCheckUtils]: 135: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,791 INFO L272 TraceCheckUtils]: 134: Hoare triple {30037#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,791 INFO L290 TraceCheckUtils]: 133: Hoare triple {30037#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:42,792 INFO L290 TraceCheckUtils]: 132: Hoare triple {30032#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-08 04:07:42,792 INFO L290 TraceCheckUtils]: 131: Hoare triple {30032#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:42,792 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29956#true} {30032#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:42,793 INFO L290 TraceCheckUtils]: 129: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,793 INFO L290 TraceCheckUtils]: 128: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,793 INFO L290 TraceCheckUtils]: 127: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,793 INFO L272 TraceCheckUtils]: 126: Hoare triple {30032#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,793 INFO L290 TraceCheckUtils]: 125: Hoare triple {30032#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:42,793 INFO L290 TraceCheckUtils]: 124: Hoare triple {30027#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-08 04:07:42,794 INFO L290 TraceCheckUtils]: 123: Hoare triple {30027#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:42,794 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29956#true} {30027#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:42,794 INFO L290 TraceCheckUtils]: 121: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,794 INFO L290 TraceCheckUtils]: 120: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,794 INFO L290 TraceCheckUtils]: 119: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,794 INFO L272 TraceCheckUtils]: 118: Hoare triple {30027#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,795 INFO L290 TraceCheckUtils]: 117: Hoare triple {30027#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:42,795 INFO L290 TraceCheckUtils]: 116: Hoare triple {30022#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-08 04:07:42,795 INFO L290 TraceCheckUtils]: 115: Hoare triple {30022#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:42,796 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29956#true} {30022#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:42,796 INFO L290 TraceCheckUtils]: 113: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,796 INFO L290 TraceCheckUtils]: 112: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,796 INFO L290 TraceCheckUtils]: 111: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,796 INFO L272 TraceCheckUtils]: 110: Hoare triple {30022#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,796 INFO L290 TraceCheckUtils]: 109: Hoare triple {30022#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:42,797 INFO L290 TraceCheckUtils]: 108: Hoare triple {30017#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-08 04:07:42,797 INFO L290 TraceCheckUtils]: 107: Hoare triple {30017#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:42,797 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29956#true} {30017#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:42,797 INFO L290 TraceCheckUtils]: 105: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,797 INFO L290 TraceCheckUtils]: 104: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,798 INFO L290 TraceCheckUtils]: 103: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,798 INFO L272 TraceCheckUtils]: 102: Hoare triple {30017#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,798 INFO L290 TraceCheckUtils]: 101: Hoare triple {30017#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:42,798 INFO L290 TraceCheckUtils]: 100: Hoare triple {30012#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-08 04:07:42,799 INFO L290 TraceCheckUtils]: 99: Hoare triple {30012#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:42,799 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29956#true} {30012#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:42,799 INFO L290 TraceCheckUtils]: 97: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,799 INFO L290 TraceCheckUtils]: 96: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,799 INFO L290 TraceCheckUtils]: 95: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,799 INFO L272 TraceCheckUtils]: 94: Hoare triple {30012#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,799 INFO L290 TraceCheckUtils]: 93: Hoare triple {30012#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:42,800 INFO L290 TraceCheckUtils]: 92: Hoare triple {30007#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-08 04:07:42,800 INFO L290 TraceCheckUtils]: 91: Hoare triple {30007#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:42,801 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29956#true} {30007#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:42,801 INFO L290 TraceCheckUtils]: 89: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,801 INFO L290 TraceCheckUtils]: 88: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,801 INFO L290 TraceCheckUtils]: 87: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,801 INFO L272 TraceCheckUtils]: 86: Hoare triple {30007#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,801 INFO L290 TraceCheckUtils]: 85: Hoare triple {30007#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:42,801 INFO L290 TraceCheckUtils]: 84: Hoare triple {30002#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-08 04:07:42,802 INFO L290 TraceCheckUtils]: 83: Hoare triple {30002#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:42,802 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29956#true} {30002#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:42,802 INFO L290 TraceCheckUtils]: 81: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,802 INFO L290 TraceCheckUtils]: 80: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,802 INFO L290 TraceCheckUtils]: 79: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,802 INFO L272 TraceCheckUtils]: 78: Hoare triple {30002#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,803 INFO L290 TraceCheckUtils]: 77: Hoare triple {30002#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:42,803 INFO L290 TraceCheckUtils]: 76: Hoare triple {29997#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-08 04:07:42,803 INFO L290 TraceCheckUtils]: 75: Hoare triple {29997#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:42,804 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29956#true} {29997#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:42,804 INFO L290 TraceCheckUtils]: 73: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,804 INFO L290 TraceCheckUtils]: 72: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,804 INFO L290 TraceCheckUtils]: 71: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,804 INFO L272 TraceCheckUtils]: 70: Hoare triple {29997#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,804 INFO L290 TraceCheckUtils]: 69: Hoare triple {29997#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:42,805 INFO L290 TraceCheckUtils]: 68: Hoare triple {29992#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-08 04:07:42,805 INFO L290 TraceCheckUtils]: 67: Hoare triple {29992#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:42,805 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29956#true} {29992#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:42,805 INFO L290 TraceCheckUtils]: 65: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,805 INFO L290 TraceCheckUtils]: 64: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,806 INFO L290 TraceCheckUtils]: 63: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,806 INFO L272 TraceCheckUtils]: 62: Hoare triple {29992#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,806 INFO L290 TraceCheckUtils]: 61: Hoare triple {29992#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:42,806 INFO L290 TraceCheckUtils]: 60: Hoare triple {29987#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-08 04:07:42,806 INFO L290 TraceCheckUtils]: 59: Hoare triple {29987#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:42,807 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29956#true} {29987#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:42,807 INFO L290 TraceCheckUtils]: 57: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,807 INFO L290 TraceCheckUtils]: 56: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,807 INFO L290 TraceCheckUtils]: 55: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,807 INFO L272 TraceCheckUtils]: 54: Hoare triple {29987#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,807 INFO L290 TraceCheckUtils]: 53: Hoare triple {29987#(<= main_~n~0 (+ main_~i~1 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:42,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {29982#(<= main_~n~0 (+ main_~i~1 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-08 04:07:42,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {29982#(<= main_~n~0 (+ main_~i~1 13))} havoc #t~mem5; {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-08 04:07:42,808 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29956#true} {29982#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-08 04:07:42,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,809 INFO L290 TraceCheckUtils]: 47: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,809 INFO L272 TraceCheckUtils]: 46: Hoare triple {29982#(<= main_~n~0 (+ main_~i~1 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,809 INFO L290 TraceCheckUtils]: 45: Hoare triple {29982#(<= main_~n~0 (+ main_~i~1 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-08 04:07:42,809 INFO L290 TraceCheckUtils]: 44: Hoare triple {30854#(<= main_~n~0 (+ main_~i~1 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-08 04:07:42,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {30854#(<= main_~n~0 (+ main_~i~1 14))} havoc #t~mem5; {30854#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-08 04:07:42,810 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29956#true} {30854#(<= main_~n~0 (+ main_~i~1 14))} #68#return; {30854#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-08 04:07:42,810 INFO L290 TraceCheckUtils]: 41: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-08 04:07:42,810 INFO L290 TraceCheckUtils]: 39: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-08 04:07:42,810 INFO L272 TraceCheckUtils]: 38: Hoare triple {30854#(<= main_~n~0 (+ main_~i~1 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-08 04:07:42,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {30854#(<= main_~n~0 (+ main_~i~1 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30854#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-08 04:07:42,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {29976#(<= main_~n~0 14)} ~i~1 := 0; {30854#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-08 04:07:42,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {29975#(<= main_~i~0 14)} assume !(~i~0 < ~n~0); {29976#(<= main_~n~0 14)} is VALID [2022-04-08 04:07:42,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {29974#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29975#(<= main_~i~0 14)} is VALID [2022-04-08 04:07:42,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {29974#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29974#(<= main_~i~0 13)} is VALID [2022-04-08 04:07:42,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {29973#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29974#(<= main_~i~0 13)} is VALID [2022-04-08 04:07:42,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {29973#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29973#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:42,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {29972#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29973#(<= main_~i~0 12)} is VALID [2022-04-08 04:07:42,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {29972#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29972#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:42,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {29971#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29972#(<= main_~i~0 11)} is VALID [2022-04-08 04:07:42,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {29971#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29971#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:42,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {29970#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29971#(<= main_~i~0 10)} is VALID [2022-04-08 04:07:42,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {29970#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29970#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:42,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {29969#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29970#(<= main_~i~0 9)} is VALID [2022-04-08 04:07:42,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {29969#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29969#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:42,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {29968#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29969#(<= main_~i~0 8)} is VALID [2022-04-08 04:07:42,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {29968#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29968#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:42,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {29967#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29968#(<= main_~i~0 7)} is VALID [2022-04-08 04:07:42,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {29967#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29967#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:42,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {29966#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29967#(<= main_~i~0 6)} is VALID [2022-04-08 04:07:42,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {29966#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29966#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:42,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {29965#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29966#(<= main_~i~0 5)} is VALID [2022-04-08 04:07:42,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {29965#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29965#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:42,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {29964#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29965#(<= main_~i~0 4)} is VALID [2022-04-08 04:07:42,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {29964#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29964#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:42,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {29963#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29964#(<= main_~i~0 3)} is VALID [2022-04-08 04:07:42,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {29963#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29963#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:42,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {29962#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29963#(<= main_~i~0 2)} is VALID [2022-04-08 04:07:42,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {29962#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29962#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:42,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {30070#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29962#(<= main_~i~0 1)} is VALID [2022-04-08 04:07:42,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {30070#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {30070#(<= main_~i~0 0)} is VALID [2022-04-08 04:07:42,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {29956#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {30070#(<= main_~i~0 0)} is VALID [2022-04-08 04:07:42,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {29956#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29956#true} is VALID [2022-04-08 04:07:42,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {29956#true} call #t~ret6 := main(); {29956#true} is VALID [2022-04-08 04:07:42,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29956#true} #70#return; {29956#true} is VALID [2022-04-08 04:07:42,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-08 04:07:42,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#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(9, 2); {29956#true} is VALID [2022-04-08 04:07:42,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {29956#true} call ULTIMATE.init(); {29956#true} is VALID [2022-04-08 04:07:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 420 proven. 196 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-08 04:07:42,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328209177] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:07:42,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 04:07:42,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 51 [2022-04-08 04:07:42,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:07:42,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1809725497] [2022-04-08 04:07:42,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1809725497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:07:42,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:07:42,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-08 04:07:42,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920431455] [2022-04-08 04:07:42,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:07:42,830 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 154 [2022-04-08 04:07:42,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:07:42,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 04:07:42,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:07:42,910 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-08 04:07:42,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:07:42,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-08 04:07:42,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=1983, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 04:07:42,911 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 04:07:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:44,794 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2022-04-08 04:07:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 04:07:44,795 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 154 [2022-04-08 04:07:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:07:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 04:07:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 134 transitions. [2022-04-08 04:07:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 04:07:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 134 transitions. [2022-04-08 04:07:44,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 134 transitions. [2022-04-08 04:07:44,896 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-08 04:07:44,898 INFO L225 Difference]: With dead ends: 228 [2022-04-08 04:07:44,898 INFO L226 Difference]: Without dead ends: 160 [2022-04-08 04:07:44,899 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1162, Invalid=5480, Unknown=0, NotChecked=0, Total=6642 [2022-04-08 04:07:44,900 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 60 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 04:07:44,900 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 93 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 04:07:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-08 04:07:45,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2022-04-08 04:07:45,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:07:45,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:07:45,053 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:07:45,053 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:07:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:45,054 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-08 04:07:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-08 04:07:45,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:07:45,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:07:45,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 160 states. [2022-04-08 04:07:45,055 INFO L87 Difference]: Start difference. First operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 160 states. [2022-04-08 04:07:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:45,056 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-08 04:07:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-08 04:07:45,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:07:45,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:07:45,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:07:45,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:07:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:07:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2022-04-08 04:07:45,059 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2022-04-08 04:07:45,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:07:45,059 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2022-04-08 04:07:45,060 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 04:07:45,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 160 transitions. [2022-04-08 04:07:45,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:07:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2022-04-08 04:07:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-08 04:07:45,321 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:07:45,321 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:07:45,354 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-08 04:07:45,535 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 04:07:45,535 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:07:45,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:07:45,536 INFO L85 PathProgramCache]: Analyzing trace with hash -829694852, now seen corresponding path program 55 times [2022-04-08 04:07:45,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:07:45,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1930121494] [2022-04-08 04:07:45,537 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:07:45,538 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 04:07:45,538 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:07:45,538 INFO L85 PathProgramCache]: Analyzing trace with hash -829694852, now seen corresponding path program 56 times [2022-04-08 04:07:45,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:07:45,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077315975] [2022-04-08 04:07:45,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:07:45,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:07:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:07:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {32241#(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(9, 2); {32145#true} is VALID [2022-04-08 04:07:46,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32145#true} {32145#true} #70#return; {32145#true} is VALID [2022-04-08 04:07:46,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-08 04:07:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} #68#return; {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:07:46,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 04:07:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} #68#return; {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-08 04:07:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #68#return; {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-08 04:07:46,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-08 04:07:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-08 04:07:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-08 04:07:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:07:46,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-08 04:07:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-08 04:07:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:07:46,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-08 04:07:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:07:46,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-04-08 04:07:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:07:46,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-04-08 04:07:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-04-08 04:07:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:07:46,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-04-08 04:07:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:07:46,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-08 04:07:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:07:46,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {32145#true} call ULTIMATE.init(); {32241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:07:46,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {32241#(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(9, 2); {32145#true} is VALID [2022-04-08 04:07:46,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32145#true} #70#return; {32145#true} is VALID [2022-04-08 04:07:46,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {32145#true} call #t~ret6 := main(); {32145#true} is VALID [2022-04-08 04:07:46,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {32145#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {32145#true} is VALID [2022-04-08 04:07:46,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {32145#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {32150#(= main_~i~0 0)} is VALID [2022-04-08 04:07:46,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {32150#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32150#(= main_~i~0 0)} is VALID [2022-04-08 04:07:46,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {32150#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32151#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:07:46,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {32151#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32151#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-08 04:07:46,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {32151#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32152#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:07:46,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {32152#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32152#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-08 04:07:46,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {32152#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32153#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:07:46,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {32153#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32153#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:07:46,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {32153#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32154#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:07:46,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {32154#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32154#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-08 04:07:46,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {32154#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32155#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:07:46,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {32155#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32155#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-08 04:07:46,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {32155#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32156#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:07:46,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {32156#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32156#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-08 04:07:46,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {32156#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32157#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:07:46,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {32157#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32157#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 04:07:46,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {32157#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32158#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:07:46,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {32158#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32158#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-08 04:07:46,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {32158#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32159#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:07:46,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {32159#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32159#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-08 04:07:46,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {32159#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32160#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-08 04:07:46,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {32160#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32160#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-08 04:07:46,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {32160#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32161#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-08 04:07:46,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {32161#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32161#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-08 04:07:46,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {32161#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32162#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-08 04:07:46,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {32162#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32162#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-08 04:07:46,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {32162#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32163#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-08 04:07:46,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {32163#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32163#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-08 04:07:46,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {32163#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32164#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-08 04:07:46,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {32164#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32165#(and (<= main_~i~0 14) (<= 14 main_~i~0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-08 04:07:46,262 INFO L290 TraceCheckUtils]: 36: Hoare triple {32165#(and (<= main_~i~0 14) (<= 14 main_~i~0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32166#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} is VALID [2022-04-08 04:07:46,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {32166#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} assume !(~i~0 < ~n~0); {32166#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} is VALID [2022-04-08 04:07:46,263 INFO L290 TraceCheckUtils]: 38: Hoare triple {32166#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} ~i~1 := 0; {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:07:46,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:07:46,263 INFO L272 TraceCheckUtils]: 40: Hoare triple {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-08 04:07:46,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,264 INFO L290 TraceCheckUtils]: 43: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,264 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {32145#true} {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} #68#return; {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:07:46,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} havoc #t~mem5; {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-08 04:07:46,265 INFO L290 TraceCheckUtils]: 46: Hoare triple {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,265 INFO L290 TraceCheckUtils]: 47: Hoare triple {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,265 INFO L272 TraceCheckUtils]: 48: Hoare triple {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-08 04:07:46,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,265 INFO L290 TraceCheckUtils]: 50: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,265 INFO L290 TraceCheckUtils]: 51: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,266 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {32145#true} {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} #68#return; {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} havoc #t~mem5; {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-08 04:07:46,267 INFO L290 TraceCheckUtils]: 55: Hoare triple {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-08 04:07:46,267 INFO L272 TraceCheckUtils]: 56: Hoare triple {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-08 04:07:46,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,268 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {32145#true} {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #68#return; {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-08 04:07:46,268 INFO L290 TraceCheckUtils]: 61: Hoare triple {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} havoc #t~mem5; {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-08 04:07:46,268 INFO L290 TraceCheckUtils]: 62: Hoare triple {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,269 INFO L290 TraceCheckUtils]: 63: Hoare triple {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,269 INFO L272 TraceCheckUtils]: 64: Hoare triple {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-08 04:07:46,269 INFO L290 TraceCheckUtils]: 65: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,269 INFO L290 TraceCheckUtils]: 66: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,269 INFO L290 TraceCheckUtils]: 67: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,270 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {32145#true} {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,270 INFO L290 TraceCheckUtils]: 69: Hoare triple {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} havoc #t~mem5; {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,270 INFO L290 TraceCheckUtils]: 70: Hoare triple {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,271 INFO L290 TraceCheckUtils]: 71: Hoare triple {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,271 INFO L272 TraceCheckUtils]: 72: Hoare triple {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-08 04:07:46,271 INFO L290 TraceCheckUtils]: 73: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,271 INFO L290 TraceCheckUtils]: 74: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,271 INFO L290 TraceCheckUtils]: 75: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,271 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {32145#true} {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,272 INFO L290 TraceCheckUtils]: 77: Hoare triple {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} havoc #t~mem5; {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,272 INFO L290 TraceCheckUtils]: 78: Hoare triple {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:07:46,272 INFO L290 TraceCheckUtils]: 79: Hoare triple {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:07:46,273 INFO L272 TraceCheckUtils]: 80: Hoare triple {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-08 04:07:46,273 INFO L290 TraceCheckUtils]: 81: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,273 INFO L290 TraceCheckUtils]: 82: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,273 INFO L290 TraceCheckUtils]: 83: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,273 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {32145#true} {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:07:46,273 INFO L290 TraceCheckUtils]: 85: Hoare triple {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-08 04:07:46,274 INFO L290 TraceCheckUtils]: 86: Hoare triple {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,274 INFO L290 TraceCheckUtils]: 87: Hoare triple {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,274 INFO L272 TraceCheckUtils]: 88: Hoare triple {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-08 04:07:46,274 INFO L290 TraceCheckUtils]: 89: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,274 INFO L290 TraceCheckUtils]: 90: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,275 INFO L290 TraceCheckUtils]: 91: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,275 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32145#true} {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,275 INFO L290 TraceCheckUtils]: 93: Hoare triple {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,276 INFO L290 TraceCheckUtils]: 94: Hoare triple {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:07:46,276 INFO L290 TraceCheckUtils]: 95: Hoare triple {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:07:46,276 INFO L272 TraceCheckUtils]: 96: Hoare triple {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-08 04:07:46,276 INFO L290 TraceCheckUtils]: 97: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,276 INFO L290 TraceCheckUtils]: 98: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,276 INFO L290 TraceCheckUtils]: 99: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,277 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {32145#true} {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:07:46,277 INFO L290 TraceCheckUtils]: 101: Hoare triple {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-08 04:07:46,277 INFO L290 TraceCheckUtils]: 102: Hoare triple {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:07:46,278 INFO L290 TraceCheckUtils]: 103: Hoare triple {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:07:46,278 INFO L272 TraceCheckUtils]: 104: Hoare triple {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-08 04:07:46,278 INFO L290 TraceCheckUtils]: 105: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,278 INFO L290 TraceCheckUtils]: 106: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,278 INFO L290 TraceCheckUtils]: 107: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,278 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {32145#true} {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:07:46,279 INFO L290 TraceCheckUtils]: 109: Hoare triple {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-08 04:07:46,279 INFO L290 TraceCheckUtils]: 110: Hoare triple {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:07:46,279 INFO L290 TraceCheckUtils]: 111: Hoare triple {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:07:46,279 INFO L272 TraceCheckUtils]: 112: Hoare triple {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-08 04:07:46,280 INFO L290 TraceCheckUtils]: 113: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,280 INFO L290 TraceCheckUtils]: 114: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,280 INFO L290 TraceCheckUtils]: 115: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,280 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {32145#true} {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:07:46,280 INFO L290 TraceCheckUtils]: 117: Hoare triple {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-08 04:07:46,281 INFO L290 TraceCheckUtils]: 118: Hoare triple {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,281 INFO L290 TraceCheckUtils]: 119: Hoare triple {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,281 INFO L272 TraceCheckUtils]: 120: Hoare triple {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-08 04:07:46,281 INFO L290 TraceCheckUtils]: 121: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,281 INFO L290 TraceCheckUtils]: 122: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,281 INFO L290 TraceCheckUtils]: 123: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,282 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {32145#true} {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,282 INFO L290 TraceCheckUtils]: 125: Hoare triple {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,283 INFO L290 TraceCheckUtils]: 126: Hoare triple {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:07:46,283 INFO L290 TraceCheckUtils]: 127: Hoare triple {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:07:46,283 INFO L272 TraceCheckUtils]: 128: Hoare triple {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-08 04:07:46,283 INFO L290 TraceCheckUtils]: 129: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,283 INFO L290 TraceCheckUtils]: 130: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,283 INFO L290 TraceCheckUtils]: 131: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,284 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {32145#true} {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:07:46,284 INFO L290 TraceCheckUtils]: 133: Hoare triple {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-08 04:07:46,284 INFO L290 TraceCheckUtils]: 134: Hoare triple {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:07:46,285 INFO L290 TraceCheckUtils]: 135: Hoare triple {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:07:46,285 INFO L272 TraceCheckUtils]: 136: Hoare triple {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-08 04:07:46,285 INFO L290 TraceCheckUtils]: 137: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,285 INFO L290 TraceCheckUtils]: 138: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,285 INFO L290 TraceCheckUtils]: 139: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,285 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {32145#true} {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:07:46,286 INFO L290 TraceCheckUtils]: 141: Hoare triple {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-08 04:07:46,286 INFO L290 TraceCheckUtils]: 142: Hoare triple {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:07:46,286 INFO L290 TraceCheckUtils]: 143: Hoare triple {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:07:46,286 INFO L272 TraceCheckUtils]: 144: Hoare triple {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-08 04:07:46,286 INFO L290 TraceCheckUtils]: 145: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-08 04:07:46,287 INFO L290 TraceCheckUtils]: 146: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-08 04:07:46,287 INFO L290 TraceCheckUtils]: 147: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-08 04:07:46,287 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {32145#true} {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:07:46,287 INFO L290 TraceCheckUtils]: 149: Hoare triple {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-08 04:07:46,288 INFO L290 TraceCheckUtils]: 150: Hoare triple {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32237#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-08 04:07:46,288 INFO L290 TraceCheckUtils]: 151: Hoare triple {32237#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32238#(= |main_#t~mem5| 0)} is VALID [2022-04-08 04:07:46,288 INFO L272 TraceCheckUtils]: 152: Hoare triple {32238#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32239#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:07:46,289 INFO L290 TraceCheckUtils]: 153: Hoare triple {32239#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32240#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:07:46,289 INFO L290 TraceCheckUtils]: 154: Hoare triple {32240#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32146#false} is VALID [2022-04-08 04:07:46,289 INFO L290 TraceCheckUtils]: 155: Hoare triple {32146#false} assume !false; {32146#false} is VALID [2022-04-08 04:07:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 28 proven. 617 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-08 04:07:46,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:07:46,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077315975] [2022-04-08 04:07:46,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077315975] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:07:46,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076949394] [2022-04-08 04:07:46,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:07:46,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:07:46,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:07:46,291 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-08 04:07:46,292 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-08 04:07:46,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:07:46,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:07:46,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-08 04:07:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:46,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:07:46,655 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